Status: IN
`(left + right) // 2` selects the left-middle element for even-length ranges, producing a left-leaning balanced BST; choosing `(left + right + 1) // 2` would also be valid.
Source: entries/2026/06/06/convert-sorted-array-to-binary-search-tree-solution.md