226. Invert Binary Tree

Invert a binary tree.

 4

/ \
2 7
/ \ / \
1 3 6 9
to
4
/ \
7 2
/ \ / \
9 6 3 1
Trivia:
This problem was inspired by this original tweet by Max Howell:
Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off.

public class Solution {
    public TreeNode invertTree(TreeNode tn){  
        if(tn == null) return null;  
        Stack<TreeNode> tnStack = new Stack<TreeNode>();  
        tnStack.push(tn);  
        while(!tnStack.isEmpty()){  
            TreeNode cur = tnStack.pop(); 

            TreeNode temp = cur.left;  
            cur.left = cur.right;  
            cur.right = temp;  

            if(cur.left != null) tnStack.push(cur.left);  
            if(cur.right != null) tnStack.push(cur.right);  
        }  
        return tn;  
    }  
}
//1、交换根节点的左右子树。
//2、对左右子树分别执行递归反转 。