题目：
https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/
答案：
递归分治：
public TreeNode sortedArrayToBST(int[] nums) {
return createBST(nums,0,nums.length-1);
}
public TreeNode createBST(int[] nums, int l,int r){
if(l>r) return null;
int mid = l + (r-l)/2;
扫描二维码关注公众号，回复：
11683122 查看本文章
TreeNode treeNode = new TreeNode(nums[mid]);
treeNode.left = createBST(nums,l,mid-1);
treeNode.right = createBST(nums,mid+1,r);
return treeNode;
}