leetcode-108 Convert Sorted Array to Binary Search Tree

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:

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

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5

 

主要要求为   其中每个节点的两个子树的深度相差不超过1，并且为二叉搜索树，那么直接找出中间节点进行左右两边分离：

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