Postorder Binary Tree
Posted: 3 Aug, 2017
Difficulty: Easy
For a given Binary Tree of integers, print the post-order traversal.
Input Format:
The first and the only line of input will contain the node data, all separated by a single space. Since -1 is used as an indication whether the left or right node data exist for root, it will not be a part of the node data.
Output Format:
The only line of output prints the post-order traversal of the given binary tree.
Constraints:
1 <= N <= 10^6
Where N is the total number of nodes in the binary tree.
Time Limit: 1 sec
Working on approaches!
Meanwhile, please head to Code Editor and try the problem there.
Meanwhile, please head to Code Editor and try the problem there.
SIMILAR PROBLEMS
Preorder Traversal
Posted: 18 Jan, 2022
Difficulty: Easy
Inorder Traversal
Posted: 19 Jan, 2022
Difficulty: Easy
Postorder Traversal
Posted: 20 Jan, 2022
Difficulty: Easy
Height of Binary Tree
Posted: 22 Apr, 2022
Difficulty: Easy
Locked Binary Tree
Posted: 12 May, 2022
Difficulty: Easy