{"id":"find-leaf-bisect-right-consistency","text":"_find_leaf, _search, and _insert all use bisect_right (not bisect_left) for child-pointer routing, ensuring all three methods agree on which leaf owns a given key; this is consistent with the split strategy where the separator key equals the first key of the right sibling.","truth_value":"IN","source":"entries/2026/05/29/b-tree-storage-engine-btree-_find_leaf.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"explanation":{"steps":[{"node":"find-leaf-bisect-right-consistency","truth_value":"IN","reason":"premise"}]}}