Left-Leaning Red-Black Trees
Red-Black Trees were originally designed by taking a 2-3-4 tree and unrolling the big nodes into a cluster of simpler binary tree nodes. The 2-3-4 node operations are mapped to binary tree operations. Now Robert Sedgewick presented a new tree called Left-Leaning Red-Black Tree. A Red-Black tree has a lot of cases you have to consider, especially if you delete a node. This makes the...