What is an AVL tree?

What is an AVL tree?

Approach: Define self-balancing BST with height constraint.

A self-balancing binary search tree where the heights of the two child subtrees of any node differ by at most one.

Follow-up: What is a rotation in an AVL tree?

Key concepts: balance factor, rotations.