Problem title
Difficulty
Avg time to solve

Number Of Vehicles
Easy
15 mins
Merge Sort
Easy
15 mins
Detect And Remove Cycle
Easy
10 mins
Is Height Balanced Binary Tree
Moderate
15 mins
Unique Paths II
Moderate
25 mins
Minimum Cost To Make String Valid
Moderate
20 mins
Reverse the array
Easy
--
Reverse A LL
Moderate
30 mins
Easy
15 mins
Count Subsequences
Moderate
30 mins
20

# Binary Tree Pruning

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

Problem Statement

#### Note :

``````A subtree of a node X is X, plus every node that is a descendant of X.
``````

#### For Example :

``````Look at the below example to see a Binary Tree pruning.
Input: [1, 1, 1, 0, 1, 0, 1, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1]
``````

``````Output: [1, 1, 1, -1, 1, -1, 1, -1, -1, -1, -1]

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
``````

#### 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 only line of each test case contains elements in the level order form. The line consists of values of nodes separated by a single space. In case a node is null, we take -1 on its place.
``````

#### Output Format :

``````Print the level order traversal of the pruned binary tree.

Print output of each test case in a separate line.
``````

#### Note :

``````You are not required to print the expected output, it has already been taken care of. Just implement the function.
``````

#### Constraints :

``````1 <= T <= 10^2
0 <= N <= 10^3
0 <= data <= 1

Where 'N' is the number of nodes in the tree and 'data' is the value of nodes.

Time Limit: 1 sec
``````
##### Sample Input 1 :
``````2
1 -1 0 0 1 -1 -1 -1 -1
0 1 1 0 0 0 -1 -1 -1 1 -1 -1 -1 -1 -1
``````
##### Sample Output 1 :
``````1 -1 0 -1 1 -1 -1
0 1 1 -1 0 -1 -1 1 -1 -1 -1
``````
##### Explanation Of Sample Input 1 :
``````For the first test case, the given binary tree(on left) and the pruned binary tree(on right) are
``````

##### Sample Input 2 :
``````2
0 -1 -1
1 0 -1 -1 -1
``````
##### Sample Output 2 :
``````-1
1 -1 -1
``````
Console