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
- leaf — A tree node with no children, at the bottom of a branch.
- B-tree — A balanced search tree whose nodes each hold many sorted keys and have many children, so the tree is very wide and very shallow.
Taught in
- B-Trees: The Structure Behind Every Database Index — Algorithms & Data Structures for Working Engineers