Top View of Binary Tree Problem Statement

Given a Binary Tree of integers, you are tasked with finding the top view of the binary tree. The top view is the set of nodes visible when the tree is viewed from the top.

Input:

The input consists of multiple test cases.

The first line contains an integer 'T' which denotes the number of test cases.

The first line of each test case contains elements of the tree in level order form; node values are separated by a single space. A node is represented as -1 if it is null.

Output:

For each test case, return a list or vector containing the elements of the top view of the given tree.

Example:

Input:

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

Output:

{10, 4, 2, 1, 3, 6}

Constraints:

• 1 ≤ T ≤ 100
• 0 ≤ N ≤ 1000
• 0 ≤ data ≤ 106 and data ≠ -1

Where 'N' is the total number of nodes in the binary tree, and 'data' is the node value.

Time limit: 1 sec

Note:

• The first not-null node of the previous level is considered the parent of the first two nodes of the current level, the second not-null node is the parent for the next two nodes, and so on.
• The input ends when all nodes at the last level are null (-1).

No need to print the output, focus on implementing the function to solve the problem.