LeetCode226 InvertBinaryTree Java题解

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

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

public static  TreeNode invertTree(TreeNode root) {

if(root!=null)
{
TreeNode temNode=root.left;
root.left=root.right;
root.right=temNode;
invertTree(root.left);
invertTree(root.right);
}

return root;

}