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
- tree — A hierarchy of nodes joined by edges, with one root at the top, no cycles, and exactly one path between any two nodes.
- root — The single node at the top of a tree, the only one with no parent.
- internal node — A tree node that has at least one child, so it is not a leaf.
Taught in
- Stacks And Queues: Last In Or First In — Algorithms & Data Structures for Working Engineers
- Deques And Ring Buffers — Algorithms & Data Structures for Working Engineers
- Binary Trees And Their Traversals — Algorithms & Data Structures for Working Engineers
- Binary Search Trees: Search, Insert And Delete — Algorithms & Data Structures for Working Engineers
- B-Trees: The Structure Behind Every Database Index — Algorithms & Data Structures for Working Engineers
- Backtracking: Search With Pruning — Algorithms & Data Structures for Working Engineers