Given a sorted ascending array
nums with no duplicates. Build a height-balanced binary search tree and return its root. The middle element of the array is the root; the left and right halves become the left and right subtrees.Example 1
Input: nums = [1,3]
Output: [3,1]
Explanation: Two elements: root is 3, left child is 1.
Output: [3,1]
Explanation: Two elements: root is 3, left child is 1.
Example 2
Input: nums = [-10,-3,0,5,9]
Output: [0,-3,9,-10,null,5]
Explanation: Root is 0, balanced BST.
Output: [0,-3,9,-10,null,5]
Explanation: Root is 0, balanced BST.