Leetcode226 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 Solution226 {
    public void layerTraverse(TreeNode root) {
        Queue<TreeNode> queue = new LinkedList<TreeNode>();

        queue.add(root);

        while (!queue.isEmpty()) {
            TreeNode tmp = queue.poll();
            System.out.print(tmp.val + " , ");

            if(tmp.left != null) {
                queue.add(tmp.left);
            }

            if(tmp.right != null) {
                queue.add(tmp.right);
            }
        }
    }
    public TreeNode invertTree(TreeNode root) {
        if(root == null) return root;

        Queue<TreeNode> queue = new LinkedList<TreeNode>();

        queue.add(root);

        while (!queue.isEmpty()) {
            TreeNode tmp = queue.poll();
            TreeNode left = tmp.left, right= tmp.right;

            tmp.left = right;
            tmp.right = left;

            if(left!=null) {
                queue.add(left);
            }

            if(right != null) {
                queue.add(right);
            }
        }

        return root;
    }
    public static void main(String[] args) {
        TreeNode root = new TreeNode(4);

        root.left = new TreeNode(2);
        root.right = new TreeNode(7);

        root.left.left = new TreeNode(1);
        root.left.right = new TreeNode(3);

        root.right.left = new TreeNode(6);
        root.right.right = new TreeNode(9);

        Solution226 ans = new Solution226();

        ans.layerTraverse(root);

        root = ans.invertTree(root);
        System.out.println();

        ans.layerTraverse(root);
    }
}