Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

1 | Given the sorted array: [-10,-3,0,5,9], |

数组转BST，比链表要简单

1 | /** |