Convert Sorted Array to Binary Search Tree ---LeetCode

https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/

解题思路：

题目给我们一个已按升序排好的数组，让我们把它转换为一棵高度平衡的二叉查找树。已排好序的数组的中点可以看做根节点，中点左边的数组即为左子树，右边的数组即为右子树，再递归左子树和右子树来构造整棵 BST。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
        if (nums == null || nums.length == 0) return null;
        return helper(nums, 0, nums.length - 1);
    }
    public TreeNode helper(int[] nums, int left, int right) {
        if (left > right) return null;
        int mid = left + (right - left) / 2;
        TreeNode root = new TreeNode(nums[mid]);

        root.left  = helper(nums, left, mid -1);
        root.right = helper(nums, mid + 1, right);

        return root;
    }
}