C++ 递归建树
/**
* 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) {
if(nums.empty())return NULL;
int left = 0;
int right = nums.size()-1;
return sortedArrayToBSTCore(nums,left,right);
}
TreeNode* sortedArrayToBSTCore(vector<int>&nums,int left,int right){
if(left > right)return NULL;
int mid = (left+right)/2;
TreeNode *root = new TreeNode(nums[mid]);
root->left=sortedArrayToBSTCore(nums,left,mid-1);
root->right=sortedArrayToBSTCore(nums,mid+1,right);
return root;
}
};