递归......注意看一下这里面指针,用new。new返回的是指向创建的对象的指针。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* sortedArrayToBST(vector<int>& nums) {
int n=nums.size();
if(n==0)
return NULL;
if(n==1)
return new TreeNode(nums[0]);
int mid=(0+n)/2;
TreeNode * root=new TreeNode(nums[mid]);
vector<int> lt(nums.begin(),nums.begin()+mid);
vector<int> rt(nums.begin()+mid+1,nums.end());
root->left=sortedArrayToBST(lt);
root->right=sortedArrayToBST(rt);
return root;
}
};