My recursive solution


  • 1
    F
    public TreeNode invertTree(TreeNode root) {
    	if (root == null || (root.left == null && root.right == null))
    		return root;
    	TreeNode temp = root.left;
    	root.left = root.right;
    	root.right = temp;
    	invertTree(root.left);
    	invertTree(root.right);
    	return root;
    }

Log in to reply
 

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