Invert Binary Tree

Invert a binary tree (swap the left and right child of every node) and print the result in level-order, using null for missing children and omitting trailing nulls.

0 <= number of nodes <= 100