Number of Binary Search Trees possible with 'n' nodes(KEYS)

[@harshilsoni859]

NO words for your explanation and your Algorithms !! JUST AWESOME.. keep it up !!!

[@SohilLadhani]

Great explanation, as always. Also, if n==0, it is a null tree. So there is only 1 way to to represent a BST having no nodes and that is a null tree. Hence, N[0] = 1

[@shivangikushwaha941]

Thank u so much sir .....now my doubt is clear .....there is the great explanation .....👍

[@ajaykhaple6853]

Deriving formula & converting it into coding part are awesome. The best diagramatic representation for visualization. Looking for more such videos . Thanks a lot...

[@quangle9049]

Thanks Vivekanand for the clear and step-by-step explanation. Keep doing your great work!

[@ananthanarayanan1513]

Amazing explaination...doing a remarkable job by explaining complex things very simply which could take hours if we are to understand ourselves... pls do more videos...

[@abhishekjaiswal6492]

great explanation sir, i don't think that there is any video on youtube like this...

[@Jugal214]

Welcome

[@aasdffew]

Thanks a lot Vivekanand, very nice explanation and analysis

[@nusratfatma]

This was a very good explanation.

[@vinayak186f3]

Zabardast 🔥🔥🔥🔥

[@arsrivaszaredan8217]

this is the best explanation!!! thanks very much

[@swasthafoods]

Very good explanation

[@raj-nq8ke]

GREAT SOLUTION BRO.

[@diptimayeeroypitam6653]

What will be of 15,18

[@stephenfernandes02oct]

The video explanation is one of the best. Thanks. Is there an video for Count the Number of Binary Search Trees present in a Binary Tree

[@abhishektalukder5326]

Thanks for this awesome explanation.

[@monis_cookhouse]

Ur amazing🤩

[@ankanmukherjee873]

Great work sir..!!

[@jeanleconte3998]

Amazing!! Thank you so much!!

[@praveenchouhan6388]

excellent work, thanks a lot.

[@AlokKumar-jh8wp]

Thank you sir for the explanation:)

[@AnkitSingh-ut7et]

i think the direct formula is 2nCn / (n+1)

[@swantanbarua9327]

what is C here?

[@manishsakariya4595]

@@swantanbarua9327 search for catalan numbers. And C is symbol for combination. 2n!/n!*n!*(n+1)

[@devendrapandey4557]

Dont mug up the formula.

[@sandeepKumar-hc1co]

thank u so much sir, thanks for your great work sir.

[@abhishekranjan1094]

Awesome 🔥

[@rajeshbammidy180]

Thanks for the explanation, but we can simply find the solution by using the Catalan number formula

[@Piyushsantwani]

He diagramatically showed why the catalan number formula works for this problem.

[@hsandeep007]

Thank you so much

[@abhishekkarn8918]

You are awesome!

[@RAJEEV_NITIAN_007]

For 0 key 1 bst possible. Using catalan number.

[@ahmedouyahya]

Awesome!!

[@vm1662]

Thanks a lot! Great video! Does anyone know how to find all the 'insertion list' if a binary tree is given?

[@pymondo1147]

Thank you :)

[@SahilJSawant]

thanks sir.

[@yyiiggaall]

Someone have any idia how to calculate this with option of 2 or more instaces of any key (or one)?

[@abhrajyotikirtania2275]

Nice!

[@martin77778]

great

[@karthiknair3077]

Catalan number problem.....

[@shubhamsunny6024]

2 to the power n - n ....simple

[@ishan_kumar]

Abey ganja pee liye ho kya ? For n =5 , answer is 42.