Java Recursive Solution


  • 0
    S

    '''

            public TreeNode invertTree(TreeNode root) {
        
        if(root==null) return root;
        
        TreeNode temp = root.left;
        root.left = root.right;
        root.right= temp;
        
        invertTree(temp);
        invertTree(root.left);
        
        return root;
        
    }
    

    '''


Log in to reply
 

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