原题链接在这里:https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/
本题与Convert Sorted List to Binary Search Tree相似,不同就是这个argument是array. 所以为了方便记左右index来做递归,就建一个有多个argument的函数。这也是array递归的通用方法。然后中点取值返回TreeNode, 左侧用作生成left subtree, 右侧用作生成right subtree.
终止条件是只剩下一个点,就地返回,此时left == right. Time O(n),以为每个点只访问了一次,Space O(logn), 因为是递归调用。
Note: 当只剩下两个点时需要注意,此时middle = (left+right)/2, middle == left,
若是直接使用root.left = sortedArrayToBST(nums,left,middle-1); 就会出错,middle -1 或者会出现null或者会调用前一段元 素,所以此时应当单独讨论。
AC Java:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode sortedArrayToBST(int[] nums) {
return sortedArrayToBST(nums, 0, nums.length-1);
}
private TreeNode sortedArrayToBST(int [] nums, int left, int right){
if(nums == null || nums.length == 0){
return null;
}
if(left == right){
TreeNode tn = new TreeNode(nums[left]);
return tn;
}
int middle = (right+left)/2;
TreeNode root = new TreeNode(nums[middle]);
if(middle != left){
root.left = sortedArrayToBST(nums,left,middle-1);
}else{
root.left = null;
}
root.right = sortedArrayToBST(nums,middle+1,right);
return root;
}
}