前言
题目: 669. 修剪二叉搜索树
文档: 代码随想录——修剪二叉搜索树
编程语言: C++
解题状态: 没有思路
思路
通过递归函数的返回值来移除节点。
代码
/**
* 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* trimBST(TreeNode* root, int low, int high) {
if (root == nullptr) return nullptr;
if (root -> val < low) return trimBST(root -> right, low, high);
if (root -> val > high) return trimBST(root -> left, low, high);
root -> left = trimBST(root -> left, low, high);
root -> right = trimBST(root -> right, low, high);
return root;
}
};