Left-Leaning Red-Black Trees

• BST
• Manage depth of nodes using coloration
• Modified coloration rules
1. Every node is either red or black
2. Root is black
3. (Left-Leaning Property) If a node is red, then it is the left child of its parent
4. (Height Limiting Property) On any Root-Null path, no more than two consequtive nodes are red
5. (Balance Property) All root-null paths have the same number of black nodes
• Sedgewick, 2007