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 'N' nodes where the nodes have integer values.

Your task is to find the largest number that could be formed by concatenating all its nodes values.

```
For the given binary tree:
```

```
Output: 96553210
Explanation: After concatenating all the numbers in the above binary tree this is the largest number that can be formed.
```

Detailed explanation

```
1 <= T <= 5
0 <= N <= 10^4
0 <= data <= 10^3
Where 'N' denotes the total number of nodes and 'data' denotes the node value of the Binary Tree.
Time limit: 1 sec
```

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

```
321
654
```

```
In test case 1, the input Binary Tree will be represented as:
```

```
From all possible permutations of concatenated integers in the above Binary Tree, the largest number possible is 321.
In test case 2, the input Binary Tree will be:
```

```
From all possible permutations of concatenated integers in the above Binary Tree, the largest number possible is 654.
```

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

```
6544321
7654321
```

```
In test case 1, the input Binary Tree will be represented as:
```

```
From all possible permutations of concatenated integers in the above Binary Tree, the largest number possible is 6544321.
In test case 2, the input Binary Tree will be represented as shown in the Input Format section above. From all possible permutations of concatenated integers in the above Binary Tree, the largest number possible is 7654321.
```