/**
* 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) {
return f(nums,0,nums.length-1);
}
public TreeNode f(int[] nums,int x,int y){
TreeNode root;
if(x<=y){
int mid=(x+y)/2;
root=new TreeNode(nums[mid]);
root.left=f(nums,x,mid-1);
root.right=f(nums,mid+1,y);
}else return null;
return root;
}
}