Computer Science / Unit 3 CS 0109 short lesson, about 20 seconds
The AVL Tree
Captions available
The idea
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.
In practice
A contacts list stays fast at any size because its tree quietly rebalances on every insertion.
Where people slip
Balance is maintained, never assumed.
Your place on the trail
Every lesson rests on earlier ones and opens later ones. Tap any to jump.
Builds on
Unlocks
- Nothing yet depends on this.
Something wrong in this lesson? Flag it · Sources for Computer Science