B-Tree of order 4. Insert keys and watch the tree stay wide and shallow through node splits and key promotions — each split avoids deep chains and keeps disk reads minimal.

B-Tree · order 4 (max 3 keys/node) node on-path overflow·splitting promoted key
Ready

Default tree loaded from [10,20,30,40,50,60,70]. B-trees stay wide and shallow — each node holds up to 3 keys, so the tree fans out quickly and stays only a few levels deep, meaning fewer disk reads to find any key.

Speed
Demos
keys
0
height
0
nodes
0
splits (last op)
0