import java.util.*;
public class Solution {
public TreeNode sortedArrayToBST(int[] num) {
if(num==null||num.length==0)
return null;
if(num.length==1)
return new TreeNode(num[0]);
int mid = (num.length)/2;
TreeNode root = new TreeNode(num[mid]);
TreeNode left = sortedArrayToBST(Arrays.copyOfRange(num, 0, mid));
TreeNode right = sortedArrayToBST(Arrays.copyOfRange(num, mid+1, num.length));
root.left = left;
root.right = right;
return root;
}
}
public class Solution {
public TreeNode sortedArrayToBST(int[] num) {
if(num==null||num.length==0)
return null;
if(num.length==1)
return new TreeNode(num[0]);
int mid = (num.length)/2;
TreeNode root = new TreeNode(num[mid]);
TreeNode left = sortedArrayToBST(Arrays.copyOfRange(num, 0, mid));
TreeNode right = sortedArrayToBST(Arrays.copyOfRange(num, mid+1, num.length));
root.left = left;
root.right = right;
return root;
}
}