Invert Binary Tree

4
/   \
2     7
/ \   / \
1   3 6   9

4
/   \
7     2
/ \   / \
9   6 3   1

简单递归实现，调换左右子树，子树的所有子树结构一并调换了顺序。

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

return root;
}
}