Java DFS


  • 0
    L
    public TreeNode trimBST(TreeNode root, int L, int R) {
        if (root == null){
            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;
    }

  • 0
    E

    Is this DFS?


Log in to reply
 

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