Count Number of Binary Search Tree Possible given n keys Dynamic Programming

[@mukhammadmuratov5715]

That is THE best explanation for this problem. For some reason I really struggled with this one and watched a lot of guides on youtube/leetcode discussion sessions, but could not get those. Here, after just conceptual explanation I stopped the video and was able to code solution on my own. Thank you SO much Tushar, great explanation and teaching, keep it up!

[@m0rtale195]

Great explanation! Helped me through a homework question asking for a similar algorithm.

[@partheshsoni6421]

You are the best DSA content providing channel. Thanks a lot!

[@santhoshmedide5279]

I saw a couple videos and explanations for this question so far and this's been the best one out there.

[@pl5778]

this is the best explanation on youtube, thanks for this!

[@prodev7401]

GO GO Tushar :))) the best channel

[@rajeshkumarjha007raj]

Hello friends. Coding karlo. Jokes apart, i appreciate your efforts, you'er a fabulous teacher. Keep growing.

[@AK-fk8jv]

haha lol

[@fatihgul4027]

Great explanation

[@sameergirkar]

Very good video to understand this problem. Thanks Tushar.

[@vinittodai911]

Awesomest Explanation!

[@lambdastudies3409]

What a legend sir! Salute and thanks

[@chrisogonas]

Well illustrated. Thanks

[@treksis]

still the best. video recorded in 2015.

[@JJ-Bond]

but how tho? what are those two for loops from? It seems like a huge jump from the algo to the code. where's that thought process?

[@bluemoonsri]

yes, he should have spent more time explaining the code

[@ronki18]

lol, guess you are just too dumb

[@191sri]

Hi Tushar, Can you help to solve this kind of problem Question : Given a set of N numbers [1,N], partition them into 2 disjoint subsets based on a set of K queries. Each query is of the type (n1, n2) where n1 and n2 are distinct numbers from the set and n1 and n2 belong to opposite subsets. Example: Input: Input: N = 4 K = [(1, 2), (1, 3), (2, 4)] Output: Set 1 : (1,4) Set 2 : (2,3)

[@create_space812]

very clear! thank you Tushar!

[@Yzhang250]

Great great explanation of the answer, can you talk more about catalan number?

[@SivaBhargavRavella]

good explanation.

[@ramkumarps185]

How did u arrive at the first and second for loop conditions and the formula T[j] * T[i-j-1] ? I could understand how the multiply works though but cannot understand the generalization here.

[@executer77]

(2n)!/(n+1)!*n! ..............same here bro couldn't get the generalization and the formula as well.

[@vigneshnaik7158]

Both left subtree and right subtree are linked. So if the number of structures of left subtree is x and number of right subtree structures is y. Then unique trees formed will be x*y. Suppose x=2 and y=2. Then I'll be having 4 different and unique tree structures ryt.

[@bharathateja2797]

very nice explanation thanks

[@ameyapatil1139]

very well explained.

[@jeetgandhi5629]

Amazing Solution! Thank you, sir!

[@mubiale4060]

Thanks, its clear to understand

[@hjkc6000]

Google should hire this man

[@DheerajKumarBarnwal]

He is an Engineering manager at Apple.

[@m16biswas45]

thank you so much.......

[@prakashhiranandani]

Thank You Sir!!! great help in understanding DP problems :) Keep it up!!!

[@shobhitranjan3957]

brilliant!

[@noornoorjahan4261]

you can simply use this formula( 2n! / (n+1)! X n!) and substitute the n value simple.

[@siaw0000]

Very nice video! I've been trying to find answers to this question, but most sites I've come across only offer the answer with no explanation how they got there.

[@RohanKumar-vx5sb]

Tushar!!! Cant thank enough!!

[@ashwinsubu5521]

Perfect explanation. What if you wanna display all the possible BSTs too? How would you handle that? Do you have a video for that?

[@vikrant4666]

he's doing job in apple now , he dont have time for ur shit now

[@herbertzhou2598]

awesome

[@arnaudcortisse1041]

"BST is a tree where every node has two child" --> I stopped there...

[@windmaomao]

Well, you have to have some tolerance for common sense, which might not be mathematically accurate.

[@suhanshupatel9204]

Thanku you!!

[@swagatzeher]

Superb explanation as always ! By the way I like your hairstyle :)

[@AnuragGarg-dexter]

Great explanation. I have a doubt though. What happens if there are duplicate elements?

[@hardikrana2649]

BST never have duplicates

[@praffulmittal28]

Anurag Garg bro their is no duplicate item in bst.....

[@skootergofast123]

its 1 to n....so no duplicates

[@lavishgarg4274]

There are no duplicate element in the BST

[@b9944236]

Best

[@sarora8475]

wow thanks!

[@Rajuvlogs9182]

initially ,there was only one tree with value 2.find the total number of trees present after cutting k trees .input:1,input:5 and output :3 c++ program Pls tell me

[@SnehasishGhoshSg]

Awesome Thhuusar..

[@konstantinshalnev2173]

Brilliant. Thanks.

[@jinyi0313]

how to calculate possible triangle in binary tree. example if i insert 7 points it will return 4 triangle. thank you for asnwer

[@pranaytanniru7764]

Thank you

[@kenrivkenriv5645]

pretty good！

[@ranjithcheguri]

Thanks man.

[@deepakpoojari9019]

great thanks man!!!!

[@evgeny1555]

What if some nodes have the same keys? For example 1, 1, 1, 2, 2, 2

[@ashishjaiswal4207]

we will on the left node

[@ІванМанчур-е7з]

This is not possible - every key in BST must be unique

[@artempar]

I tried both solutions that provided - and they both return wrong count. For n = 3 it returns 12, not 5.

[@harishchandramohan1823]

If given numbers are 7,9,11 . There are 6 different BST possible. But u said for 3 elements only 5 bst possible how?

[@SHASHANKRUSTAGII]

This was in my test series

[@11m0]

Could u explain why we multiply instead of adding when a certain number is the root like at 4:53?

[@abhishekpandey4427]

Permutations and combinations is the chapter you should study

[@Majorchaoss]

multiplication is considering both possibilities happen together, addition implies either of the possibilities can happen.

[@umarazahid6183]

what are the ways to search a nuber from a tree?

[@Atpugtihsrah]

KZbin generated caption right said "Hello friends, my name is too sharp ... " 😀

[@viraj_singh]

great

[@shairafghan4470]

R/Sir Please help me in completing my assignment Q1) what is running time of of algorithm. First write the recurrence equation and then find its complexity function(int n) { if (n

[@koustavdas6585]

It is a catalan number. But how it come. Please derive the general rule

[@shoebmoin10]

This can be done simply by finding the catalan number.

[@meganlee5897]

this is Catalan number.

[@lavishgarg4274]

Yes this can be implemented directly by formula, but understanding the app. is important, ie from where that formula has actually derived

[@pseudonym033]

miaoooooo I love Indian nerds

[@nehasehta7762]

pl explain no of binary trees possible with n unlabeled or labeled nodes

[@srijankumarsamanta5579]

www.geeksforgeeks.org/enumeration-of-binary-trees/

[@sahukarinaveenkumar3188]

If we give n=384 it is giving wrong answer.. could anyone plz check

[@virinchisavanapelli5898]

why t[0]=1?

[@vaibhavchhabra800]

+Tushar Roy I don't think it is a question of dynamic programming n there is a direct formula for this question Proof - www.geeksforgeeks.org/g-fact-18/

[@easynet1yt]

+Tushar Roy hahah..Made my day !!! I was just mugging up this formula. Your comment made me to watch whole video once again. Thanks for videos !! Subscribed !! :D

[@AnantSF]

Memorization without memoization doesn't help. :)

[@SundeepI9]

2:38 what happened to 11 - 12 - 10

[@capybara42069]

10 wouldn't be greater than 11

[@umarazahid6183]

answer please hurry up?