internal node

A tree node that has at least one child, so it is not a leaf.

In more detail

In a B-tree, internal nodes hold keys that direct the search downward; each can have up to 2t children. In a B-plus tree, internal nodes hold only keys, never full records.

Related terms

Taught in

References