What is an AVL Tree?

What is an AVL Tree?

Approach: Define a strictly balanced binary search tree.

The first self-balancing binary search tree. For any node, the heights of the two child subtrees differ by at most one. If they differ by more, rebalancing (rotations) is performed.

Follow-up: Why might a Red-Black tree be preferred over AVL in practice?

Key concepts: balance factor, rotations, strict height.