Data Structures
AVL Trees:Height Balance When You Need Strict Guarantees
An AVL tree is a BST that rebalances on insert and delete so height stays O(log n). Balance factors, rotations, and when the extra strictness is worth it versus red-black.
Read More