Binary Tree Right View Problem Statement

Given a binary tree of integers, your task is to print the right view of it. The right view represents a set of nodes visible when the tree is viewed from the right side. These nodes are printed in a top-to-bottom order.

Input:

The first line contains an integer 'T' which denotes the number of test cases. Then, the test cases follow.
The only line of input for each test case contains the elements of the tree in level order form, separated by a single space.
If a node does not have a left or right child, use -1 in its place.
All nodes of the last level will be null (-1).

Output:

For each test case, print the right view of the tree. Output for each test case should be on a new line.

Example:

Input:

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

Output:

1 3 6 7

Constraints:

• 1 <= T <= 100
• 1 <= N <= 105
• -109 <= data <= 109

Note:

You do not need to print anything, it has already been taken care of. Just implement the given function.