226. Invert Binary Tree

以下博客纯属上手，大牛们勿喷。
**问题描述：
Invert a binary tree.
4
/ \
2 7
/ \ / \
1 3 6 9
to
4
/ \
7 2
/ \ / \
9 6 3 1**

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.
谷歌：虽然我们 90% 工程师都在用你写的软件（Homebrew），但你不能在白板上反转二叉树，所以滚蛋。

下面附上代码：
/

**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode invertTree(TreeNode root) {
        if(root==null){
            return null;
        }
        TreeNode temp = root.left;
        root.left = root.right;
        root.right  = temp;
        invertTree(root.left);
        invertTree(root.right);
        return root;
    }
}