Leetcode 108. Convert Sorted Array to Binary Search Tree

Given a strictly increasing sorted array, construct a height-balanced binary search tree whose in-order traversal yields the original array. The core challenge is arranging elements (via divide-and-conquer/midpoint selection) to keep tree height minimal and balanced.