Red-black trees: Samuel's tutorial

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

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

  • @seyedmatintavakoliafshari8272
    @seyedmatintavakoliafshari8272 10 месяцев назад +4

    Wow man I genuinely have respect towards your videos, especially this one! I used to teach red-black trees back in my BSc, and to see how you elegantly (and yet compactly) illustrated to such detail how it all works out was truly mesmerizing! Very efficient. Keep up the good work.

  • @salpelter
    @salpelter 22 дня назад +1

    this is a really well-made video but now i realize how fucking complicated this is, i swear to god my head is about to explode

  • @yifumao1379
    @yifumao1379 5 месяцев назад +1

    Thanks, very nice slides and animation.

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

    Great video

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

    Just came here for the revision, just found a video of O(logn) time length. Kudos to your effort and dedication.

  • @benhuston4201
    @benhuston4201 5 месяцев назад

    Great video, thank you!

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

    If u.left == self.nil shouldn't we replace u with u.right and vice versa?

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

      Yes, well-spotted! Thanks for flagging this, I'll update the slides.

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

    This is madness. I stopped watching after the deletion algorithm part. I don't get why how is the very concept of red-black trees was devised at the first place, I don't get why it is worth studying (why is it better AVL trees at all), and why we need to consider this highly specific situations ("red uncle", etc).

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

    First