A bijection for the evolution of $B$-trees

Fabian Burghart, Stephan Wagner

A $B$-tree is a type of search tree where every node (except possibly for the root) contains between $m$ and $2m$ keys for some positive integer $m$, and all leaves have the same d…