Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
解题思路： dfs ，按照bst的定义，从nums的中点选做head， 然后左右两边去dfs

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17

 public TreeNode sortedArrayToBST(int[] nums) {
      if (nums.length == 0) {
          return null;
      }
      TreeNode head = helper(nums, 0, nums.length - 1);
      return head;
    }
    public TreeNode helper(int[] nums, int low, int high) {
        if (low > high) { // Done
            return null;
        }
        int mid = (low + high) /2;
        TreeNode node = new TreeNode(nums[mid]);
        node.left = helper(nums, low, mid - 1);
        node.right = helper(nums, mid + 1, high);
        return node;
    }