B-Tree
Order t:
2 (2-3-4)
3
Key:
Insert
Random 15
Reset
B-Tree of order t: each node has tâ2t keys. Splits propagate upward keeping tree balanced. Used in databases and file systems.