3

Ancestors in Binary Tree

Difficulty: MEDIUM
Contributed By
Arindam Majumder
Avg. time to solve
20 min
Success Rate
80%

Problem Statement

You are given a binary tree with ‘N’ number of nodes and a node ‘K’.Your task is to print a list of all the ancestors of the given node ‘K’ in reverse order (lowest ancestor first).

A binary tree is a hierarchical data structure in which each node has at most two children.

Example:

Here, for ‘k’ = 7, the output will be 14 12 10.
Input Format:
The first line contains an Integer 'T' which denotes the number of test cases or queries to be run. Then the test cases follow.

The first line of each test case contains the elements of the tree in the level order form separated by a single space.
If any node does not have a left or right child, take -1 in its place. Refer to the example below.

The second line of each test case contains a single integer ‘k’, denoting the value of the node whose ancestors you have to found.

The given node may not be present in the tree. But it is guaranteed that there will be a maximum of one node with the value ‘k’.
Example:
Elements are in the level order form. The input consists of values of nodes separated by a single space in a single line. In case a node is null, we take -1 in its place.

For example, the input for the tree depicted in the below image would be :

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

Explanation :
Level 1 :
The root node of the tree is 1

Level 2 :
Left child of 1 = 2
Right child of 1 = 3

Level 3 :
Left child of 2 = 4
Right child of 2 = null (-1)
Left child of 3 = 5
Right child of 3 = 6

Level 4 :
Left child of 4 = null (-1)
Right child of 4 = 7
Left child of 5 = null (-1)
Right child of 5 = null (-1)
Left child of 6 = null (-1)
Right child of 6 = null (-1)

Level 5 :
Left child of 7 = null (-1)
Right child of 7 = null (-1)

The first not-null node (of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on.

The input ends when all nodes at the last level are null (-1).

Note: The above format was just to provide clarity on how the input is formed for a given tree. 

The sequence will be put together in a single line separated by a single space. Hence, for the above-depicted tree, the input will be given as:

1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1
Output Format:
For each test case, print a list of integers denoting the ancestors of the given node in reverse order(lowest ancestor first). If the node is not present in the tree, then return -1.

Output for each test case will be printed in a separate line.
Note:
You are not required to print anything, it has already been taken care of. Just implement the function.
Constraints:
1 <= T <= 100
1 <= N <= 5 * 10^3
0 <= X <= 10^9

Where ‘X’ is the value at the node.

Time Limit: 1 sec.
Sample Input 1:
2
19 17 32 11 -1 -1 -1 25 -1 -1 -1
11
15 2 6 9 8 27 11 -1 -1 -1 -1 -1 -1 -1 -1
9
Sample Output 1:
17 19
2 15
Explanation For Sample Output 1:
For the first test case, the tree will be:

Here, for ‘k’ = 11, the output will be 17 19.

For the second test case, the tree will be:

Here, for ‘k’ = 9, the output will be 2 15.
Sample Input 2:
2
1 3 5 4 -1 -1 -1 -1 -1
4
17 25 99 54 61 11 -1 -1 -1 -1 -1 -1 -1
11
Sample Output 2:
3 1
99 17
Reset Code
Full screen
copy-code
Console