AVL Trees

Self-balancing BSTs where subtree heights differ by at most 1, restored by rotations.

Advanced

Guarantee $O(\log n)$ search/insert/delete; stricter balance than red-black trees, so faster lookups.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)