【leetcode 二叉树】669. Trim a Binary Search Tree

最新推荐文章于 2023-01-03 19:30:17 发布

笨比master

最新推荐文章于 2023-01-03 19:30:17 发布

阅读量161

点赞数

分类专栏： leetcode 文章标签：二叉树 leetcode

本文链接：https://blog.csdn.net/m0_37454852/article/details/113275922

版权

leetcode 专栏收录该内容

288 篇文章 0 订阅

订阅专栏

669. Trim a Binary Search Tree

在这里插入图片描述

/**
 * 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 root;
        if(root->left) root->left = trimBST(root->left, low, high);
        if(root->right) root->right = trimBST(root->right, low, high);
        if(root->val < low) {
            root = root->right;
            root = trimBST(root, low, high);
        }
        else if(root->val > high) {
            root = root->left;
            root = trimBST(root, low, high);
        }
        return root;
    }
};