leaf

A tree node with no children, at the bottom of a branch.

In more detail

Inserting into a binary search tree always creates a new leaf. Deleting a leaf is the easiest of the three BST delete cases. In a B-plus tree, all the actual data lives in the leaves.

Related terms

Taught in

References