题目描述
思路分析
二叉树,数组复原BST,递归
结论:把中间当作根节点,递归处理左右子树。
代码实现
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* sortedArrayToBST(vector<int>& nums) {
return dfs(nums,0,nums.size()-1);
}
TreeNode* dfs(vector<int>& nums,int l,int r){
if(l>r) return NULL;
int mid=l+r>>1;
auto root=new TreeNode(nums[mid]);
root->left=dfs(nums,l,mid-1);
root->right=dfs(nums,mid+1,r);
return root;
}
};