btree-bisect-left-leaf-bisect-right-internal

Status: IN

`_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.

Source: entries/2026/05/29/b-tree-storage-engine-btree-_search.md

JSON