[LeetCode]669. Trim a Binary Search Tree

[LeetCode]669. Trim a Binary Search Tree

题目描述

思路

递归
当前节点值未在规定范围内时，递归更新当前节点值到范围后，之后递归更新当前节点的左右子树

代码

#include<iostream>

using namespace std;

struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

class Solution {
public:
    TreeNode* trimBST(TreeNode* root, int L, int R) {
        if (root == NULL) return NULL;
        if (root->val < L) return trimBST(root->right, L, R);
        if (root->val > R) return trimBST(root->left, L, R);
        root->left = trimBST(root->left, L, R);
        root->right = trimBST(root->right, L, R);

        return root;
    }
};