C++ - O(n) solution


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

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.