Populating Next Right Pointers in Each Node

Given a complete binary tree with 'N' nodes, your task is to determine the 'next' node immediately to the right in level order for each node in the given tree.

Input:

Input begins with an integer 'T', representing the number of test cases.
For each test case, a line provides the tree's elements in level order, separated by spaces. Use -1 for null nodes.

Output:

For each test case, print the tree's level order traversal, showing the updated 'next' node for each node, where -1 represents a null node. Each test case's output should be on a new line.

Example:

Input:

1
1 2 3 4 5 6 7 -1 -1 -1 -1 -1 -1 -1 -1

Output:

1 # 2 3 # 4 5 6 7 #

Explanation:

The input represents a complete binary tree where each node points to its immediate right neighbor at the same level, or 'null' if no such neighbor exists.

Constraints:

• 1 <= T <= 5
• 0 <= N <= 3000
• 1 <= data <= N
• The tree is always a complete binary tree.
• Time Limit: 1 sec

Note:

Do not print anything; your task is to implement the function that updates the 'next' pointers.