{"id":"point-lookup-always-reaches-leaf","text":"Every `get` must descend to a leaf node regardless of tree height since internal nodes hold no values; cost is exactly *h* page reads for a tree of height *h*","truth_value":"IN","source":"entries/2026/05/29/topic-b-plus-tree-leaf-chains.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"explanation":{"steps":[{"node":"point-lookup-always-reaches-leaf","truth_value":"IN","reason":"premise"}]}}