Optimal Binary Search Tree Algorithm with Example using Dynamic Programming Part 2 |L-17||DAA|

[@vharshavardhan1420]

mamdam your explaination is to good i have seen many videos of OBST i didn't understand any where but i have learned these topic only seeing 1 time tq mam

[@royalcoc4817]

one of the best explanation ever

[@Tobi_794]

U made my preparation much easy ..tq lov u❤

[@ramlaxmanrepala7510]

Thankyou so much mam 🎉😊

[@Acadmix0395]

Why did we take root node as (0,4)??

[@vipuldudyala9709]

Actually we need to find r(0,4) with k . But directly we cannot find . So we are doing this problem just to find r(0,4) and constructing it's tree

[@anasibrahim8413]

What

[@preserved_for_YESHUA]

Thank you so much sister, God bless you

[@chinthalaharibabu3699]

akka tq very much it is very help full to prepare

[@sanaboinaakshara841]

Nice explanation mam.. thank u so much 😊

[@spidygaming9993]

Well explained

[@anbusuriyan6555]

Excellent performance madam

[@Akbarvlogss]

Good ❤

[@bharathmaramoni9654]

Madam how many cases we have to do mam

[@sumitsorout-r7i]

mam but in case 2 me to aapne k ki value to direct li h kya vo galat h

[@dineshreddymamidi9448]

Is there any possibility for offline classes mam?

[@yoursbroski]

❤love u

[@Pavan-cn3em]

🙏🏻

[@paladisrivani]

thankkk youu mammm

[@mahimahesh5244]

Very lengthy answer mam,we need short short explanation

[@funedits6225]

Its too long 😮😢

[@asthabahuendra3391]

ezzzz

[@Crazyfunny_reaction.videos]

free palesthina 😓