A leaf node is the lowest level of a B-tree index. It stores sorted index entries with references to the corresponding table records. section 4.1
Use leaf nodes to understand how an index search finishes and how ordered retrieval works:
- Branch nodes direct the search toward the leaf containing the target entry. section 4.1
- Leaf nodes link together in order, allowing range queries and ordered retrieval without navigating back up the tree. section 4.1
Finding ID = 5
A root entry of 10 directs the search to a branch containing 6 and 10. Entry 6 then points to a leaf containing 1, 4, 5, and 6, where the reference for ID = 5 is found. section 4.1
Figure 4.1 A sample B-tree index showing the search path to the index entry with ID = 5
Trace the root-to-branch-to-leaf search path for ID = 5 in the B-tree diagram. section 4.1
