Binary Tree Inversion

Write a function to invert a binary tree. This means that for every node in the tree, we swap the left and right children. Inverting a tree can be visualized as creating a mirror image of the tree. Input Format: - The first line contains an integer n (the number of nodes). - The next n lines each contain an integer value representing the node value of the binary tree in level order, with -1 indicating a null node. Output Format: - Print the level order traversal of the inverted binary tree as a space-separated string. Example: Input: 7 1 2 3 4 -1 5 6 Output: 1 3 2 6 5 4