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

题目描述：

 思路：数组是有序的，我们选数组中间的数字作为中间结点，两边各取中间分别作为该根节点的左、右结点，如此递归下去。

代码如下：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
if(nums.length==0){
    return null;
}
return sortedArrayToBSTHelp(nums,0,nums.length-1);
    }
    TreeNode sortedArrayToBSTHelp(int[] nums,int start,int end){
        if(start>end){
            return null;
        }
int mid=start+(end-start)/2;
TreeNode node=new TreeNode(nums[mid]);
node.left=sortedArrayToBSTHelp(nums,start,mid-1);
node.right=sortedArrayToBSTHelp(nums,mid+1,end);
return node;
    }
}