Optimal Binary Search Tree - Dynamic Programming |OBST|Algorithms|DAA|Short Tricks

Поделиться
HTML-код
  • Опубликовано: 13 янв 2025

Комментарии • 38

  • @mohdkaif-y7g
    @mohdkaif-y7g Год назад +6

    Wow such an amazing video, nice explain for very difficult problem , i see your lecture and solve in exam only 7 min , you are great Sir ur teaching methodology also unique THANK U SO MUCH sir

    • @CSEACADEMY1
      @CSEACADEMY1  Год назад

      Thank u so dear for ur valuable comments

  • @mycojin5185
    @mycojin5185 Месяц назад +1

    I was tryna find a good explanation that can help me to solve OBST tables quicker, and this one really helps. Although I cannot understand Hindi, but since the numbers and the word "minimum" are pronounced in English, I finally understood. Better than lots of the profs. Great teaching and thanks a lot!

  • @B1_CE103_VidhiKothia
    @B1_CE103_VidhiKothia 11 месяцев назад +1

    Such an amazing video, thanks a lot sir

    • @CSEACADEMY1
      @CSEACADEMY1  11 месяцев назад

      Thank u so much dear! Pls subscribe the channel and also share ur friends for more videos

  • @SakshamKapoor-es1zm
    @SakshamKapoor-es1zm 10 месяцев назад +3

    Initially no. of keys are 6 but in BST only 5 keys are taken key0 is lost?

    • @CSEACADEMY1
      @CSEACADEMY1  10 месяцев назад

      Root node has fixed so (n-1) keys are required to construct OBST

  • @VaishnavUke
    @VaishnavUke Год назад +2

    thank you sir very much appreciate you work❤❤❤

  • @mani55555-b
    @mani55555-b Год назад +2

    Best sir

  • @mdshahjadaalam7380
    @mdshahjadaalam7380 Год назад +2

    Nice ❤️

  • @ahsanulhasib8554
    @ahsanulhasib8554 Год назад +3

    What about examples with only probability for successful search?

    • @CSEACADEMY1
      @CSEACADEMY1  Год назад

      Because probability of successful search is help to build a binary search tree n it provide the way to search the key in minimum time

    • @CSEACADEMY1
      @CSEACADEMY1  Год назад

      Thank u so much for ur comment please subscribe to channel for more videos

  • @joshbasnet3014
    @joshbasnet3014 6 месяцев назад +1

    Can i use this for 4x4 (keys and frequency) rather than (key and probability)?

  • @aadeshlawande346
    @aadeshlawande346 8 месяцев назад +1

    is this trick applicable for 3x3 matrix problem ?

  • @lakshayverma6557
    @lakshayverma6557 7 месяцев назад

    thanks a lot

  • @devpatel-hw2zk
    @devpatel-hw2zk 9 месяцев назад +2

    thankyou sir for sharing this trick ! grateful

    • @CSEACADEMY1
      @CSEACADEMY1  9 месяцев назад

      Keep watching dear and subscribe our channel n also share ur friends

  • @khemlatabisen
    @khemlatabisen Месяц назад +1

    Sir university me aise solve kre to pure marks milege ky

  • @funedits6225
    @funedits6225 Месяц назад +1

    University exam me esa chalega kya

    • @CSEACADEMY1
      @CSEACADEMY1  Месяц назад

      @@funedits6225 yes

    • @CSEACADEMY1
      @CSEACADEMY1  Месяц назад

      Please subscribe the channel n also share ur friends

  • @Movie_2updates-
    @Movie_2updates- 2 месяца назад +1

    My mam said the same explanation from your video 😂😂

  • @nagpurkaengineer
    @nagpurkaengineer Год назад +2

    ❤❤❤❤

  • @vishalgavali476
    @vishalgavali476 8 месяцев назад +1

    SIRF last ki tree nhi smji...baki expalnation NICE

    • @CSEACADEMY1
      @CSEACADEMY1  8 месяцев назад +1

      Thanks, for Tree watch part 2

  • @eternalcrypto
    @eternalcrypto 2 месяца назад +1

    bc sab samajh agaya lekin last me jo sir apne obst construct kiya na usme kya minus kiya kya kiya kuch ghanta samajh nahi aya sir 🙃

    • @CSEACADEMY1
      @CSEACADEMY1  2 месяца назад

      @@eternalcrypto dear pls see obst part 2

    • @eternalcrypto
      @eternalcrypto 2 месяца назад

      @CSEACADEMY1 ok bro👍