Problem of the day
For the given binary tree:
The Postorder traversal will be [5, 2, 3, 7, 6, 4, 1].
The first line contains an integer 'T' which denotes the number of test cases.
The first and only line of each test case contains elements of the tree 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.
The input for the tree is depicted in the below image:
1 3 8 5 2 7 -1 -1 -1 -1 -1 -1 -1
Level 1 :
The root node of the tree is 1
Level 2 :
Left child of 1 = 3
Right child of 1 = 8
Level 3 :
Left child of 3 = 5
Right child of 3 = 2
Left child of 8 =7
Right child of 8 = null (-1)
Level 4 :
Left child of 5 = null (-1)
Right child of 5 = null (-1)
Left child of 2 = null (-1)
Right child of 2 = null (-1)
Left child of 7 = null (-1)
Right child of 7 = null (-1)
1
3 8
5 2 7 -1
-1 -1 -1 -1 -1 -1
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.
2. The input ends when all nodes at the last level are null(-1).
3. 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 3 8 5 2 7 -1 -1 -1 -1 -1 -1 -1
For each test case, return a vector containing the Post-Order traversal of a given binary tree.
The first and only line of output of each test case prints 'N' single space-separated integers denoting the node's values in Post-Order traversal.
You don't need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 10
0 <= N <= 3000
0 <= data <= 10^9
Where 'data' denotes the node value of the binary tree nodes.
Time limit: 1 sec
2
1 2 3 -1 -1 -1 6 -1 -1
1 2 3 -1 -1 -1 -1
2 6 3 1
2 3 1
In test case 1, the given binary tree is shown below:
Postorder traversal of given tree = [2, 6, 3, 1]
In test case 2, the given binary tree is shown below:
Postorder traversal of given tree = [2, 3, 1]
2
1 -1 -1
1 2 4 5 3 -1 -1 -1 -1 -1 -1
1
5 3 2 4 1
In test case 1, there is only one node, so Post-Order traversal will be only [1].
In test case 2, the given binary tree is shown below:
Postorder traversal of given tree = [5, 3, 2, 4, 1]