题目链接/文章讲解: https://programmercarl.com/0669.%E4%BF%AE%E5%89%AA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.html
视频讲解: https://www.bilibili.com/video/BV17P41177ud
关键的地方在于,以返回值的形式消除删掉的点所影响的节点(子树)
class Solution {
public:
TreeNode* trimBST(TreeNode* root, int low, int high) {
if(root == nullptr) return nullptr;
//根节点小于下界,直接在右子树中寻找
if(root->val < low)
{
TreeNode* right = trimBST(root->right, low, high);
return right;
}
//根节点大于上界,直接在左子树中寻找
if(root->val > high)
{
TreeNode* left = trimBST(root->left, low, high);
return left;
}
//根节点在这个范围内,对左右子树进行操作,然后返回根节点
root->left = trimBST(root->left, low, high);
root->right = trimBST(root->right, low, high);
return root;
}
};
还有简洁的代码可以看上面的具体讲解
https://programmercarl.com/0108.%E5%B0%86%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.html
视频讲解:https://www.bilibili.com/video/BV1uR4y1X7qL
class Solution {
TreeNode* traversal(vector<int>& nums, int left, int right)
{
if(left> right) return nullptr;
int mid = left + ((right-left)/2);
TreeNode* node = new TreeNode(nums[mid]);
node->left = traversal(nums, left, mid-1);
node->right = traversal(nums, mid+1,right);
return node;
}
public:
TreeNode* sortedArrayToBST(vector<int>& nums) {
TreeNode* root = traversal(nums,0,nums.size()-1);
return root;
}
};
感觉自己关于二叉树中使用递归做的方法总结的不是很好,画个图帮助自己理解一下吧
** ● 538.把二叉搜索树转换为累加树**
https://programmercarl.com/0538.%E6%8A%8A%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BD%AC%E6%8D%A2%E4%B8%BA%E7%B4%AF%E5%8A%A0%E6%A0%91.html
视频讲解:https://www.bilibili.com/video/BV1d44y1f7wP
class Solution {
public:
//这里只需要保存前一个节点的值来做累加就可以,不需要定义为节点
int pre = 0;
//目的是遍历整棵树,不需要返回值
//整个累加的思路是从有序数组的最大值开始逆序逐步累加
void traversal(TreeNode* cur)
{
//中序遍历 常用的终止判断条件
if(cur==nullptr) return;
//“右”,中序的逆序,先递归传入右孩,找到右子树的最右节点再逐步返回
traversal(cur->right);
//“中”的时候,添加单词递归的具体操作,进行累加,并对pre的值进行更新
cur->val += pre;
pre = cur->val;
//“左”
traversal(cur->left);
}
TreeNode* convertBST(TreeNode* root) {
pre = 0;
traversal(root);
return root;
}
};