Simple Java recursive solution


  • 5
    public TreeNode trimBST(TreeNode root, int L, int R) {
            if (root == null) {
                return root;
            }
    
            if (root.val > R) {
                return trimBST(root.left, L, R);
            }
    
            if (root.val < L) {
                return trimBST(root.right, L, R);
            }
    
            root.left = trimBST(root.left, L, R);
            root.right = trimBST(root.right, L, R);
            return root;
        }
    

    Also viewable here on Github.


Log in to reply
 

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