Hacker News Reader

Sedgewick also has a nice coursera lecture on 2-3 trees leading to LLRB trees. Covered in these slides:

https://www.cs.princeton.edu/~rs/talks/LLRB/RedBlack.pdf

A simpler implementation of red-black trees. Came across it and enjoyed it.

I haven't actually found LLRBs to be simpler to implement, and a couple other sources agree with me. They're pedagogically simpler than standard RB trees, but if your goal is to introduce students to a balanced binary tree, I'd argue that AVLs are easier to teach and implement than either RBs or LLRBs.

http://t-t-travails.blogspot.com/2008/04/left-leaning-red-bl...

http://www.read.seas.harvard.edu/~kohler/notes/llrb.html

Reply on news.ycombinator.com