LeetCode 108:将有序数组转换为二叉搜索树(java)
题目:
解答:
/**
* 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=buildBST(nums,0,nums.length-1);
return head;
}
public TreeNode buildBST(int[] nums,int l,int r){
if(l>r)
return null;
int mid=(l+r)/2;
TreeNode p=new TreeNode(nums[mid]);
p.left=buildBST(nums,l,mid-1);
p.right=buildBST(nums,mid+1,r);
return p;
}
}