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

Поділитися
Вставка
  • Опубліковано 23 лют 2024
  • Abroad Education Channel :
    / @shraavyakatkuri4078
    contact me on gmail at : shraavyareddy810@gmail.com
    Contact me on instagram at : / shraavya_katkuri

КОМЕНТАРІ • 9

  • @vharshavardhan1420
    @vharshavardhan1420 2 місяці тому +2

    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

  • @anbusuriyan6555
    @anbusuriyan6555 Місяць тому

    Excellent performance madam

  • @chinthalaharibabu3699
    @chinthalaharibabu3699 2 місяці тому

    akka tq very much it is very help full to prepare

  • @dineshreddymamidi9448
    @dineshreddymamidi9448 Місяць тому

    Is there any possibility for offline classes mam?

  • @varshininetha5150
    @varshininetha5150 2 місяці тому +2

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

    • @vipuldudyala9709
      @vipuldudyala9709 2 місяці тому

      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

  • @Pavan-cn3em
    @Pavan-cn3em 3 місяці тому

    🙏🏻

  • @asthabahuendra3391
    @asthabahuendra3391 Місяць тому

    ezzzz

  • @Crazyfunny_reaction.videos
    @Crazyfunny_reaction.videos 20 годин тому

    free palesthina
    😓