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

题目来源：

https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/

题目描述：

代码如下：

/**
 * 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) {
        if(nums==null||nums.length==0){
            return null;
        }
        return getTree(nums,0,nums.length-1);
    }

    public TreeNode getTree(int[] nums,int left,int right){
        if(left<=right){
            int mid=(left+right)/2;
            TreeNode node = new TreeNode(nums[mid]);
            node.left=getTree(nums,left,mid-1);
            node.right=getTree(nums,mid+1,right);
            return node;
        }else{
            return null;
        }
    }
}