A balanced search tree with many keys per node, built for disks: CLRS insert with splits on the way down, and delete with borrows and merges.
This interactive visualization needs JavaScript.