The AVL Tree
This video presents the same text shown beside it, spoken and on screen. It adds nothing the text does not say.
State
An AVL tree is a balanced binary search tree with one added property: at every node, the left and right subtrees stay balanced, and the tree rotates nodes to keep it that way.
Show
A contacts list stays fast at any size because its tree quietly rebalances on every insertion.
Watch for
Balance is maintained, never assumed.
Builds on
Unlocks
- Nothing yet depends on this.