AVL Trees
← Back to Self-Balancing Trees
Strictly balanced BST where the height difference between left and right subtrees of any node is at most 1. Rebalances via rotations after insert/delete. Faster lookups than Red-Black trees due to stricter balance, but slower inserts/deletes.