leetcode题记——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

/**
 * 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.length==0)
            return null;
        TreeNode head = bts(nums, 0, nums.length - 1);
        return head; 
    }
    public TreeNode bts(int[] nums, int low, int high){
        if(low>high)
            return null;
        int mid = ( high - low + 1 ) / 2 + low;
        TreeNode node = new TreeNode(nums[mid]);
        node.left = bts(nums, low, mid - 1);
        node.right = bts(nums, mid + 1, high);
        return node;
    }
}