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 典型的递归调用的问题，注意递归基是left > right 

2 数组的通用判断 数组为null  或者 数组的长度为0 返回null

3 递归调用的函数采用的思想是binarysearch space O(logn), 但是本题中总是要把这个二叉树遍历一边，总是要创建结点，所以space O(n)

代码

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 node = new TreeNode(nums[mid]);
        node.left = helper(nums, left, mid - 1);
        node.right = helper(nums, mid + 1, right);
        return node;
    }