{"id":"btree-bisect-left-for-leaf-exact-match","text":"Leaf lookups use `bisect_left` to find the leftmost insertion point, then check `keys[idx] == key` for exact match; `bisect_right` would return the position after all equal keys, overshooting the target.","truth_value":"IN","source":"entries/2026/05/29/topic-bisect-right-vs-left-in-btrees.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"explanation":{"steps":[{"node":"btree-bisect-left-for-leaf-exact-match","truth_value":"IN","reason":"premise"}]}}