Invert Binary Tree

public class Solution {
public TreeNode invertTree(TreeNode root) {
TreeNode temp = new TreeNode(0);
if(root == null)
{
return root;
}
temp = root.left;
root.left = root.right;
root.right = temp;
invertTree(root.right);
invertTree(root.left);
return root;
}
}