root
The single node at the top of a tree, the only one with no parent.
In more detail
Every search and traversal starts at the root. In a min-heap the root holds the smallest item; in a B-tree the root and top levels are usually kept in memory.
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.
- leaf — A tree node with no children, at the bottom of a branch.
- parent and child — The relationship between two directly connected tree nodes: the parent is the one nearer the root and the child the one below it.
Taught in
- Binary Trees And Their Traversals — Algorithms & Data Structures for Working Engineers
- Binary Search Trees: Search, Insert And Delete — Algorithms & Data Structures for Working Engineers
- AVL Trees: Rotations That Keep The Guarantee — Algorithms & Data Structures for Working Engineers
- B-Trees: The Structure Behind Every Database Index — Algorithms & Data Structures for Working Engineers
- Heaps And Priority Queues — Algorithms & Data Structures for Working Engineers
- Minimum Spanning Trees: Kruskal And Prim — Algorithms & Data Structures for Working Engineers