Optimal Binary Search Tree using Dynamic Programming

Optimal Binary Search Tree using Dynamic Programming. Find the minimum cost of search operation in the Binary search tree according to the search frequency of elements in that BST.

[rebelutionarygaming]

Sir the second binary tree with 26 as root. In that tree the Ma for node 27 is 2 not 3. Therefore the total cost is 1*3 + 2*4 + 2*2 = 15.

[melihaslan]

This channel should have had 1 Million subscribers by now!!!

[aprussupport]

On the second binary tree(26 as a root node), to access 27, why do we need 3 memory accesses instead of 2? I don't get that. Thx (on minute 13:03)

[dhritisaluja]

Hey, I love your explanation although there is a small mistake but it's okay even the most intelligent person of the world can do mistakes. I'm become a fan of your teaching 🙂

[RaviKumar-vkib]

Awesome ...great explanation...every video i have watched you have explained the concept really well ...Far
better than Abdul Bari

[quangle]

Very well explained. Please continue to the coding session. Thank you.

[itchat]

the explanation is awesome ! continue the same we are with you

[ichigo_kurosaaki]

Very simple, clear and elaborated explanation, thanks for saving my time :)
Please tell me which book are you using?

[adhishsingh]

Sir this was very helpful and each and everything was explained very clearly!!!thank you so much

[rebelutionarygaming]

Hey Vivekanand i love you brother. Great explanation.

[quangle]

Thank you for for the clear explanation. I am looking forward to see the formula or code for this video. Thanks.

[algorithmimplementer]

Another classic problem is matrix multiplication parentheses in DP. Could you make a video on that as well?

[Muneeru]

Really good explanation.. Thanks a lot.

[muralimohan]

Great explanation. One question i have is for l=2, we can get 4C2 combinations which is 6 { (0, 1) (1, 2) (2, 3) (0, 2) (0, 3) (1, 3)}. Why are we considering only 3 combinations {(0, 1)(1, 2)(2, 3)} ?

[TechTanka]

Suggestion for all of your videos - be bit fast, concise. When I watch ur vdo, I feel like I need speed x3. I always watch it in speed x2 but still feel slow 😂

[nebimertaydin]

hey this was very helpful, where is the continuation of the video?

[anjalichopra]

How the memory acess of 30 is 1?..it should be 2 at 21:10

[nagarajanarumugam]

Can you please upload playlist for greedy algorithm as well

[pramodnanduri]

Can you please share the explanation for binary search tree with dummy keys (Problem specified in Cormen textbook)

[eswarputtu]

Sir, your explanation is excellent, but at 14.... miniitues in 2 bst small flaw in your search process