108.Convert Sorted Array to Binary Search Tree （将有序数组转化成二叉排序树）

public class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
        return build(nums,0,nums.length-1);
    }
    
    public TreeNode build(int[]nums,int left,int right){
        if(left>right) return null;
        int middle = (left+right)/2;
        TreeNode root = new TreeNode(nums[middle]);
        root.left = build(nums,left,middle-1);
        root.right = build(nums,middle+1,right);
        return root;
    }
}