[CODE explaination] Count no. of Binary search trees possible with given 'n' keys

Given 'n' keys, count no. of possible BSTs that can be formed.
We use Dynamic Programming for this problem.

[@samarthsingh663]

bro you r my lifeline ...aap devata ho really bro i even recommend my professor to watch your videos they will come to know kee ds padhaya kaise jata h sir y dont u apply in my insitute (IIIT VADODARA) aap bas bolo ek bar hum sab students director ko mail daal dengay kee we want him as our teacher plz plz
;-)

[@dirtycrumbs]

Thanks for all your hard work (!) - very complete and thorough explanation :-)

[@learnsmall8583]

Thanks for all the great videos they are really helpful. Just a note, in many of your videos, you are referencing another video saying that you mentioned a link in the description below. For ex: at 0:20 sec in this case. But I don't see any links in description. Can you please add the links in the description.

[@learnsmall8583]

And for those (like me :P ) who haven't seen the previous video, here is the link: ua-cam.com/video/kT_VabdscHk/v-deo.html

[@tevaganthanveluppillai720]

Thank you. Very well explained.

[@saisrikar7987]

Can anyone be more clear than this!!! Kudos..Respect!!

[@naseemahmad7897]

great job sir

[@Ankit13555]

great sirjii...start some vdos on graphs too

[@shakirs8096]

Appreciate

[@punitpawar4231]

In this example, if we are asked to return all the unique Binary Trees formed , for a particular value of 'n', how would you approach that ? The values for the keys will be from 1 ..n

[@tempregex8520]

what would be the size of the array or your memo N? i believe it can be at max n?

[@Xyrutano]

Great video!

[@jaysahu357]

sir please tell us how to use recursion to solve new problem

[@hrishikeshsawant7098]

Link of first video:
ua-cam.com/video/kT_VabdscHk/v-deo.html

[@sanjanind]

Prev video link ua-cam.com/video/kT_VabdscHk/v-deo.html

[@abhishekjaiswal6492]

bhai har bar kandha kahe uchkate ho🤣🤣