LeetCode (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 root) {
        if(root==null)  return null;
        TreeNode right=root.right;
        TreeNode left =root.left;
        root.right=invertTree(left);
        root.left=invertTree(right);
        return root;
    }
}