669. 修剪二叉搜索树（递归和迭代）

题目链接

递归

/**
 * 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) return nullptr;
        // 值小于下界，删除该节点及左子树
        if (root->val < low) {
            root = trimBST(root->right, low, high);
            return root;
        }
        // 节点的值大于上界，删除节点及节点的右子树
        if (root->val > high) {
            root = trimBST(root->left, low, high);
            return root;
        }
        // 递归,接住修改的左子树和右子树
        root->left = trimBST(root->left, low, high);
        root->right = trimBST(root->right, low, high);
        return root;
    }
};

迭代

/**
 * 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) return nullptr;

        while(root->val < low || root->val > high) {
            if (root->val < low) root = root->right;
            else root = root->left;
            if (root == NULL) break;
        }
        TreeNode* cur = root;
        while (cur != NULL) {
            while (cur->left && cur->left->val < low) {
                cur->left = cur->left->right;
            }
            cur = cur->left;
        }

        cur = root;
        while (cur != NULL) {
            while (cur->right && cur->right->val > high) {
                cur->right = cur->right->left;
            }
            cur = cur->right;
        }
        return root;
    }
};

总结

• 将root移动到[L, R] 范围内
• 剪枝左子树，排除所有小于low的
• 剪枝右子树，排除所有大于high的