JavaScript recursive solution


  • 0
    F
    var trimBST = function(root, L, R) {
        if (!root) {
            return null
        }
        
        if (root.val < L) {
            return trimBST(root.right, L, R)
        } else 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
    }
    

Log in to reply
 

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