Concise C++ and Python Solutions


  • 0
    Y

    The idea is inspired by shawngao

    C++ solution:

    class Solution {
    public:
        TreeNode* trimBST(TreeNode* root, int L, int R) {
            if(!root) return root;
            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;
          }
    };
    

    Python solution:

    class Solution(object):
        def trimBST(self, root, L, R):
            if not root:return None
            if root.val<L: return self.trimBST(root.right,L,R)
            if root.val>R: return self.trimBST(root.left,L,R)
            root.right=self.trimBST(root.right,L,R)
            root.left=self.trimBST(root.left,L,R)
            return root
    

Log in to reply
 

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