A simple Kotlin solution (recursive)


  • 0
    W
    class Solution {
        fun trimBST(root: TreeNode?, L: Int, R: Int): TreeNode? {
            if (root == null) return null
            if (root.`val` < L) return trimBST(root.right, L, R)
            if (root.`val` > R) return trimBST(root.left, L, R)
            val node = TreeNode(root.`val`)
            node.left = trimBST(root.left, L, R)
            node.right = trimBST(root.right, L, R)
            return node
        }
    }
    

Log in to reply
 

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