Left Leaning Red Black Tree
Definition
A BST such that:
No node has two red links connected to it.
Every path from root to null link has the same number of black links.
Red links lean left.
Sample Red Black Tree with 255 Random Nodes
Balancing Red Black Tree
Complexity Analysis with other Data Structures
Last updated