7

# Serialize/Deserialize The Binary Tree

Difficulty: HARD
Contributed By
Avg. time to solve
15 min
Success Rate
85%

Problem Statement

#### You have been given a binary tree of integers. You are supposed to serialize and deserialize (refer to notes) the given binary tree. You can choose any algorithm to serialize/deserialize the given binary tree. You only have to ensure that the serialized string can be deserialized to the original binary tree.

##### Note :
``````Serialization is the process of translating a data structure or object state into a format that can be stored or transmitted (for example, across a computer network) and reconstructed later. The opposite operation that is, extracting a data structure from stored information, is deserialization.
``````
##### 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 in its place. So -1 would not be a part of the tree nodes.
``````
##### For example:
``````The input for the tree depicted in the below image will 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 the level order traversal of the deserialized binary tree separated by single spaces, for NULL nodes print -1.

Print the output of each test case in a separate line.
``````
##### Note :
``````You don’t need to print anything; It has already been taken care of.
``````
##### Constraints :
``````1 <= T <= 100
0 <= N <= 5000
1 <= data <= 10^5 and data != -1

Time Limit: 1 sec
``````
##### Sample Input 1 :
``````2
1 -1 3 -1 -1
3 4 -1 -1 -1
``````
##### Sample Output 1 :
``````1 -1 3 -1 -1
3 4 -1 -1 -1
``````
##### Explanation For Sample Input 1 :
``````For the first test case, the level order traversal of the given tree will be “1 -1 3 -1 -1” where -1 denotes the null nodes.

For the second test case,  the level order traversal of the given tree will be “3 4 -1 -1 -1” where -1 denotes the null nodes.
``````
##### Sample Input 2 :
``````2
1 2 3 -1 4 5 -1 -1 -1 -1 -1
2 1 3 4 -1 -1 5 -1 -1 -1 -1
``````
##### Sample Output 2 :
``````1 2 3 -1 4 5 -1 -1 -1 -1 -1
2 1 3 4 -1 -1 5 -1 -1 -1 -1
``````
Console