Left-Leaning Red-Black Trees
- BST
- Satisfies RB rules
- One additional "left leaning" rule keeps code simpler
- Every node is either red or black
- Root is black
- If a node is red, all its children are black
- All root-null paths have the same number of black nodes
- If a node is red, it must be a left child
- Sedgewick, 2007
|