LeetCode 面试题0402

leetcode-cn.com/problems/mi…

class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
        return sored(nums, 0, nums.length - 1);
    }

    private TreeNode sored(int[] nums, int begin, int end) {
        if (begin == end) {
            return new TreeNode(nums[begin]);
        } else if (begin > end) {
            return null;
        }
        int mid = (end + begin) / 2 ;
        TreeNode node = new TreeNode(nums[mid]);
        node.left = sored(nums, begin, mid - 1);
        node.right = sored(nums, mid + 1, end);
        return node;
    }
}