c++ solution


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

Log in to reply
 

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