AVL Tree — self-balancing binary search tree that keeps height O(log n) by rotating nodes whenever a balance factor reaches ±2.

AVL Tree · self-balancing BST node unbalanced |bf|=2 rotating new·settled
Ready

Default AVL tree loaded. Insert a value and watch the tree rotate to stay balanced — each node shows its balance factor (left height − right height).

Speed
Demos
nodes
0
height
0
rotations
0
balanced
✓