Inverted Tree Levels

Write a function that reads a binary tree and outputs its level order traversal, but with each level's node values inverted. The first level (root) stays unchanged. Input format: - The first line contains an integer N, the number of nodes in the tree. - The following N lines contain integers representing each node's value in level-order traversal. - Use -1 to indicate 'null' nodes. Output format: - Print the inverted level order traversal as space-separated values for each level, maintaining the original order of levels. Example: Input: 5 1 2 3 -1 -1 4 5 Output: 1 3 2 5 4