Last Updated: 3 Aug, 2017
Postorder Binary Tree
Easy
Asked in company
For a given Binary Tree of integers, print the post-order traversal.
The postorder traversal for the given binary tree will be 40 50 20 30 10
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
Similar problems
Inorder Traversal
Easy
Posted: 19 Jan, 2022
Inorder Traversal
Easy
Posted: 19 Jan, 2022
Inorder Traversal
Easy
Posted: 19 Jan, 2022
Inorder Traversal
Easy
Posted: 19 Jan, 2022
Inorder Traversal
Easy
Posted: 19 Jan, 2022
Postorder Traversal
Easy
Posted: 20 Jan, 2022
Postorder Traversal
Easy
Posted: 20 Jan, 2022
Height of Binary Tree
Easy
Posted: 22 Apr, 2022
Height of Binary Tree
Easy
Posted: 22 Apr, 2022
Height of Binary Tree
Easy
Posted: 22 Apr, 2022
Height of Binary Tree
Easy
Posted: 22 Apr, 2022
Locked Binary Tree
Easy
Posted: 12 May, 2022
Maximum Island Size in a Binary Tree
Moderate
Posted: 14 Oct, 2025