node split

The B-tree operation that breaks a full node into two half-full nodes and moves its middle key up into the parent.

In more detail

The course's insert splits any full node it meets on the way down, so there is always room when it reaches the leaf. When the root splits, a new root is created and the whole tree grows one level taller, which is how a B-tree keeps all leaves at equal depth.

Related terms

Taught in

References