226. Invert Binary Tree

交换二叉树的左右节点，还是用到迭代的方法。

java代码：

public TreeNode invertTree(TreeNode root) {
        if(root==null) return null;
else {
TreeNode newTree = root.left;
TreeNode left = root.left;
TreeNode right = root.right;
root.left = invertTree(right);
root.right = invertTree(newTree);
return root;
}
    }