{"id":"left-mid-bias-on-even-length","text":"`(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.","truth_value":"IN","source":"entries/2026/06/06/convert-sorted-array-to-binary-search-tree-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"left-mid-bias-on-even-length","truth_value":"IN","reason":"premise"}]}}