← CS 302 Home

2-3 Tree: Interactive

Nodes hold 1 or 2 keys (2-node or 3-node). All leaves stay at the same depth. Insertion is bottom-up splitting: overfilled nodes split and promote their middle key to the parent. Splits cascade up; a root split grows the tree by one level.

Normal
0
Keys
0
Depth
0
3-Nodes
0
2-Nodes
Try it: Load "Ascending" to see how the tree always grows upward from the root. Every leaf is at the same depth, no rotations needed!
2-node [K]
3-node [K1|K2]
Visiting / splitting
Inserted / found