找出有序数组中间数,再构造左右关系 ,迭代即可。
public TreeNode sortedArrayToBST(int[] nums) {
return sortedArrayToBST(nums,0,nums.length);
}
public TreeNode sortedArrayToBST(int[] nums,int left,int right){
if(left>=right) return null;
int mid=left+(right-left)/2;
TreeNode node=new TreeNode(nums[mid]);
node.left=sortedArrayToBST(nums,left,mid);
node.right=sortedArrayToBST(nums,mid+1,right);
return node;
}