← CS 302 Home

AVL Tree: Interactive

Self-balancing BST. Every node keeps a height field; after each insert the tree walks back up checking the balance factor and applying rotations (LL, RR, LR, RL) to keep |bf| ≤ 1.

Normal
0
Nodes
0
Height
-
Last Op Rotations
-
Min Possible
Try it: Load "Ascending" to see right-right rotations fire as the tree grows. Then load "Zig-Zag" to see double rotations (LR / RL) straighten out before rebalancing.
Node
Visiting
Rotating
Found / Inserted
Not found / Imbalanced