Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Problem of the day

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.

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

Detailed explanation

```
The only line of input 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.
```

```
The level order 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).
The above 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
```

```
Print the level order traversal of the deserialized binary tree separated by single spaces. For NULL nodes, print -1.
```

```
You don’t need to print anything; It has already been taken care of.
```

```
1 -1 3 -1 -1
```

```
1 -1 3 -1 -1
```

```
The given tree looks as follows:
1
\
3
The level order traversal of the given tree will be “1 -1 3 -1 -1” where -1 denotes the null nodes.
```

```
1 2 3 -1 4 5 -1 -1 -1 -1 -1
```

```
1 2 3 -1 4 5 -1 -1 -1 -1 -1
```

```
The given tree looks as follows:
1
/ \
2 3
\ /
4 5
The level order traversal of the given tree will be “1 2 3 -1 4 5 -1 -1 -1 -1 -1" where -1 denotes the null nodes.
```

```
The expected time complexity is O(n).
```

```
0 <= 'n' <= 10^6
1 <= 'data' <= 10^8 and data != -1,
Where 'n' is the number of nodes and 'data' is the value at the nodes.
Time Limit: 1 sec
```