Red-black trees: Samuel's tutorial

[@seyedmatintavakoliafshari8272]

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]

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]

Thanks, very nice slides and animation.

[@benhuston4201]

Great video, thank you!

[@satenderkumaryadav3497]

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

[@highwell7074]

Great video

[@AlexanderKruel]

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

[@SamuelAlbanie1]

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

[@onamixt]

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]

First