{"id":"btree-bisect-left-leaf-bisect-right-internal","text":"`_search` uses `bisect_left` at leaf nodes for exact-match lookup and `bisect_right` at internal nodes for child routing; this asymmetry matches the split convention where the median key is copied up and retained as the first key of the right leaf.","truth_value":"IN","source":"entries/2026/05/29/b-tree-storage-engine-btree-_search.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"explanation":{"steps":[{"node":"btree-bisect-left-leaf-bisect-right-internal","truth_value":"IN","reason":"premise"}]}}