Dynamic Programming: Optimal Binary Search Trees Part 1

Поделиться
HTML-код
  • Опубликовано: 31 июл 2024
  • ХоббиХобби

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

  • @SridharOnTheRooftop
    @SridharOnTheRooftop 4 года назад +13

    One of the best lecture available on you tube for OBST

  • @nguyentnhoang
    @nguyentnhoang 2 года назад +2

    This video is much easier to understand than the other ones I have come across.

  • @chinmay9402
    @chinmay9402 3 года назад +4

    Best video for understanding OBST, Thanks for sharing this video!!

  • @bablobko
    @bablobko 4 года назад +4

    Best Lecture on the Net on OBST.

  • @aahilrafiq4850
    @aahilrafiq4850 3 месяца назад

    The best explanation on youtube for this problem

  • @_paralaks_
    @_paralaks_ 3 года назад +6

    Very good explanation among the several videos I have checked but video's volume is way too low!

  • @trevorives1772
    @trevorives1772 5 лет назад +2

    I now understand the shirt from lecture.

  • @uhuruhashimoto1768
    @uhuruhashimoto1768 Год назад +1

    this problem was chill until I realized that HE'S WRITING BACKWARDS

  • @caterpillar3991
    @caterpillar3991 2 года назад +1

    Interested in how Dr. Bourke write so good when doing it reversely

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

      it looks like he's writing normally onto a mirror

  • @JustWolter
    @JustWolter 6 месяцев назад

    15k views but 9 comments? Things aren't the same..