Status: IN
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.
Source: entries/2026/05/29/topic-bisect-right-vs-left-in-btrees.md