题目:
给定一个有序整数数组,元素各不相同且按升序排列,编写一个算法,创建一棵高度最小的二叉搜索树。
示例:
给定有序数组: [-10,-3,0,5,9],
一个可能的答案是:[0,-3,9,-10,null,5],它可以表示下面这个高度平衡二叉搜索树:
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) {
TreeNode result=BST(nums, 0, nums.length-1);
return result;
}
public static TreeNode BST(int[] nums,int low,int high){
if(low>high){
return null;
}
int mid=(low+high)/2;
TreeNode root=new TreeNode(nums[mid]);
root.left=BST(nums,low,mid-1);
root.right=BST(nums, mid+1, high);
return root;
}
}