Pick one and press Start, then click Next › to step through it.
Watch for
A full leaf splitting and pushing a separator key up to its parent — that's how the tree grows upward and stays balanced.
More about this scenario
You'll learn
How a B+ tree stays shallow and balanced so every operation is a handful of page reads, no matter how much data it holds.
How it runs
Each INSERT walks root-to-leaf and places the key in sorted order; an overfull leaf splits and pushes a separator up, occasionally growing the tree a level. SEARCH walks the same path; RANGE walks the linked leaves; DELETE may merge or borrow to stay balanced.