B+ Tree Playground
n = 3 — leaf cap = 3 keys (split 2|2), internal cap = 4 pointers (split 3|2 children)
Insert
Delete
Random insert
💡 Hint: Internal nodes are blue; leaf nodes are yellow. All values are stored in the leaves (B+ tree).