0

# Clone a binary tree with random pointers.

Difficulty: EASY
Avg. time to solve
10 min
Success Rate
90%

Problem Statement
Suggest Edit

#### Note :

Two nodes may have the same value associated with them. The root node will be fixed and will be provided in the function.

##### 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 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 second line of each test case contains the values of the nodes of the tree in the random order ( -1 for NULL node), connecting the node values of the original tree with random nodes of the tree.

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 inorder traversal of the cloned binary tree separated by a single space.
On the next line, the checker will output a ‘1’ if you have cloned the tree successfully; otherwise, it will print ‘0’.

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 <= 3000
1 <= data <= 10^5 and data!=-1

Where ‘T’ is the number of test cases, and ‘N’ is the total number of nodes in the binary tree, and “data” is the value of the binary tree node

Time Limit: 1 sec
``````
##### Sample Input 1 :
``````2
1 2 3 -1 -1 -1 -1
2 3 1 -1 -1 -1 -1
5 6 7 8 -1 -1 -1 -1 -1 -1
6 8 5 7 -1 -1 -1 -1 -1 -1
``````
##### Sample Output 1 :
``````2 1 3
1
8 6 5 7
1
``````
##### Explanation of Sample Input 1 :
``````For the first test case, the inorder traversal of the cloned binary tree is  {2, 1, 3}. On the next line, the checker code will print 1 if the tree was successfully cloned.

For the second test case, the inorder traversal of the cloned binary tree is {8, 6, 5, 7}. On the next line, the checker code will print 1 if the tree was cloned successfully.
``````
##### Sample Input 2:
``````2
1 7 -1 -1 -1
1 -1 -1 -1 -1
3 4 5 -1 -1 -1 9 -1 -1
5 3 3 -1 -1 -1 4 -1 -1
``````
##### Sample Output 2:
``````7 1
1
4 3 5 9
1
``````
##### Explanation of Sample Input 2:
``````For the first test case, the inorder traversal of the cloned binary tree is  {1, 7}. On the next line, the checker code will print 1 if the tree was successfully cloned.

For the second test case, the inorder traversal of the cloned binary tree is {8, 6, 5, 7}. On the next line, the checker code will print 1 if the tree was cloned successfully.
``````