The Most Elegant Search Structure | (a,b)-trees 

It's really a personal preference, but a-b trees feel cleaner to me because all I have to remember when adding is "if too many then split" and when removing is "if too little then steal / merge".

It is - Cases to Rest. The UI on the website is, however, quite unintuitive and just pressing the play button plays a random track (you have to press on the name).

All of the software I use is free and linked in the description. I also wrote a series of tutorials on how to start animating with Manim (how most of the animations in the video are done): slama.dev/manim/introduction/

There is a mapping between a 2-3 (or 2-4, based on definitions) tree and a R&B tree. I didn't want to mention it in the video since I'd have to define what an R&B tree is and it doesn't add too much to the video.

Imagine the red nodes / red-linked nodes as actually being part of their parent black node. If you're using red-black trees where black nodes can only have one red child, that gets you a 2,3 tree. If you're using red-black trees where black nodes can have up to two red children, that gets you a 2,4 tree.

@@hemerythrin Thankyou!

The node above doesn't need to have an extra key. If it doesn't, we merge and have to fix the condition one layer above, that's why we prefer to steal (which doesn't propagate up).

@@YTomS that makes sense! Thank you!

It's definitely better compared to my older videos, but I agree that it still isn't ideal. I'll try to slow the next one down :).

​@@YTomS If it helps, your speed is the one I target when I manually change it for other slower videos :))

I don't think he spoke fast, just should've used more words to give us time to think and understand the operations

@@pratikkore7947 Or my grasping power is weaker :)

There are captions