{"id":"not-lehman-yao-blink-tree","text":"The B-tree is a classical single-threaded B⁺-tree, not a Lehman-Yao B-link tree — internal nodes lack right-link pointers, there are no high keys, and no latch coupling; leaf sibling pointers exist solely for range scan traversal.","truth_value":"IN","source":"entries/2026/05/29/topic-internal-node-format.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"explanation":{"steps":[{"node":"not-lehman-yao-blink-tree","truth_value":"IN","reason":"premise"}]}}