Indexing
Hashing your keys…
Initializing Sorting Algorithms...
Sorting
Trees
Graphs
Preparing interactive visualizations...
Indexing
Hashing your keys…
Wide nodes keep the tree shallow. When one overflows it splits, promoting its median key upward — so the tree grows at the root and every leaf stays at the same depth.
Duplicates are dropped — a B-tree index stores each key once.
Click Play to begin
O(log n)O(log n)O(log n)O(n)Question 1 of 3
When a B-tree node overflows, where does the median key go?