题目要求:
分析:
将数组的中间一个数值作为根结点,然后利用递归对其左子树和右子树进行操作。
具体代码为:
/**
* 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)
return null;
return build(nums, 0, nums.length-1);
}
public TreeNode build(int[] nums, int left, int right) {
if(left > right)
return null;
int mid = (left + right)/2;
TreeNode node = new TreeNode(nums[mid]);
node.left = build(nums, left, mid-1);
node.right = build(nums, mid+1, right);
return node;
}
}