Dynamic Programming: Optimal Binary Search Trees Part 5

Поділитися
Вставка
  • Опубліковано 19 лис 2024

КОМЕНТАРІ • 10

  • @nghivi7699
    @nghivi7699 2 роки тому +4

    so much art in a series... dang congrats on whoever gets to attend this man's class :)

  • @GetBetterWithSid
    @GetBetterWithSid 3 роки тому +3

    This playlist was a beauty. Thank you for such a wonder explanation.

  • @simranshah2827
    @simranshah2827 4 роки тому +2

    Best video out there

  • @onurcanisler
    @onurcanisler 4 роки тому +2

    Thank you professor, I subscribed to your channel.

  • @gaganaroraiit
    @gaganaroraiit 4 роки тому +2

    Best explained.

  • @BanothAnusha-hv4qn
    @BanothAnusha-hv4qn 8 місяців тому

    very good for understanding thanks for teching as sir

  • @hovo27
    @hovo27 5 років тому +2

    Thank you so much this helped me a lot, very well made.

  • @caterpillar3991
    @caterpillar3991 2 роки тому

    Not sure if it is a tongue of slip. At this point(6:55), I think Professor means that if we push right child node first and then push left child to the top of the stack, then next time we pop node from the top of the stack, we could get the left child. This makes it like a preorder traversal when we use recursion.

  • @dorsamotiallah3998
    @dorsamotiallah3998 3 роки тому +1

    thank you sooooo much you helped me a lot .

  • @abhishekauti164
    @abhishekauti164 4 роки тому +2

    Thanks and keep going up