【LeetCode】108.Convert Sorted Array to Binary Search Tree(Easy)解题报告

【LeetCode】108.Convert Sorted Array to Binary Search Tree(Easy)解题报告

题目地址：https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/description/
题目描述：

  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

Solution:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 time : O(n)
 space : O(n)
 */
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){ //space : O(logn)
        if(left > right) return null;
        int mid = (right-left)/2+left;
        TreeNode node = new TreeNode(nums[mid]);
        node.left = helper(nums,left,mid-1);
        node.right = helper(nums,mid+1,right);
        return node;
    }
}

Date：2018年3月29日