2 ms·
Red Black Trees: Approximate best case binary search tree
- aston 19y agoIf you like that, you'll really like this: http://www.cs.princeton.edu/~rs/talks/LLRB/RedBlack.pdf http://www.cs.princeton.edu/~rs/talks/LLRB/RedBlack.pdf Sedgewick's left-leaving red-black trees. Easier code to understand, same performance bounds. Beware, though, some of the code in the preso doesn't really work as claimed.