C++ solution recursion

  • 0
    TreeNode* trimBST(TreeNode* root, int L, int R) {
            if(!root) return NULL;
            if(root->val < L){
                root = trimBST(root->right, L, R);
            }else if(root->val > R){
                root = trimBST(root->left, L, R);
                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.