有序数组转换为二叉搜索树

class Solution {

    public TreeNode sortedArrayToBST(int[] nums) {

        return dfs(nums,0,nums.length-1);

    }

    public TreeNode dfs(int[] nums,int left,int right){

        if(left > right) return null;

        int m = (left + right) >>> 1;

        return new TreeNode(nums[m],dfs(nums,left,m-1),dfs(nums,m+1,right));

    }

}