Trim a Binary Search Tree (C++ trim binary search tree)

Problem-solving ideas:

(1) Recursion, if the root node is less than the lower bound, only trim the right subtree

(2) If the root node is greater than the upper bound, only trim the left subtree

/**
 * 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==NULL) return root;
        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;
    }
};