We have discussed iterative inorder and iterative preorder traversals. In this post, iterative postorder traversal is discussed, which is more complex than the other two traversals (due to its nature of non-tail recursion, there is an extra statement after the final recursive call to itself). Postorder traversal can easily be done using two stacks, though. The idea is to push reverse postorder traversal to a stack. Once we have the reversed postorder traversal in a stack, we can just pop all items one by one from the stack and print them; this order of printing will be in postorder because of the LIFO property of stacks. Now the question is, how to get reversed postorder elements in a stack – the second stack is used for this purpose. For example, in the following tree, we need to get 1, 3, 7, 6, 2, 5, 4 in a stack. If take a closer look at this sequence, we can observe that this sequence is very similar to the preorder traversal. The only difference is that the right child is visited before left child, and therefore the sequence is “root right left” instead of “root left right”. So, we can do something like iterative preorder traversal with the following differences:
a) Instead of printing an item, we push it to a stack.
b) We push the left subtree before the right subtree.
Following is the complete algorithm. After step 2, we get the reverse of a postorder traversal in the second stack. We use the first stack to get the correct order.
1. Push root to first stack. 2. Loop while first stack is not empty 2.1 Pop a node from first stack and push it to second stack 2.2 Push left and right children of the popped node to first stack 3. Print contents of second stack
Following are the steps to print postorder traversal of the above tree using two stacks.
1. Push 1 to first stack. First stack: 1 Second stack: Empty 2. Pop 1 from first stack and push it to second stack. Push left and right children of 1 to first stack First stack: 2, 3 Second stack: 1 3. Pop 3 from first stack and push it to second stack. Push left and right children of 3 to first stack First stack: 2, 6, 7 Second stack: 1, 3 4. Pop 7 from first stack and push it to second stack. First stack: 2, 6 Second stack: 1, 3, 7 5. Pop 6 from first stack and push it to second stack. First stack: 2 Second stack: 1, 3, 7, 6 6. Pop 2 from first stack and push it to second stack. Push left and right children of 2 to first stack First stack: 4, 5 Second stack: 1, 3, 7, 6, 2 7. Pop 5 from first stack and push it to second stack. First stack: 4 Second stack: 1, 3, 7, 6, 2, 5 8. Pop 4 from first stack and push it to second stack. First stack: Empty Second stack: 1, 3, 7, 6, 2, 5, 4 The algorithm stops here since there are no more items in the first stack. Observe that the contents of second stack are in postorder fashion. Print them.
Following is the implementation of iterative postorder traversal using two stacks.
4 5 2 6 7 3 1
Following is an overview of the above post.
Iterative preorder traversal can be easily implemented using two stacks. The first stack is used to get the reverse postorder traversal. The steps to get a reverse postorder are similar to iterative preorder.
You may also like to see a method which uses only one stack.
This article is compiled by Aashish Barnwal. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Iterative Postorder Traversal | Set 2 (Using One Stack)
- Iterative Postorder traversal | Set 3
- Iterative Postorder Traversal of N-ary Tree
- Construct a BST from given postorder traversal using Stack
- Print Postorder traversal from given Inorder and Preorder traversals
- Postorder traversal of Binary Tree without recursion and without stack
- Find n-th node in Postorder traversal of a Binary Tree
- Find parent of given node in a Binary Tree with given postorder traversal
- Check if a binary tree is subtree of another binary tree using preorder traversal : Iterative
- Infix to Prefix conversion using two stacks
- Bubble sort using two Stacks
- Construct Full Binary Tree using its Preorder traversal and Preorder traversal of its mirror tree
- Level order traversal of Binary Tree using Morris Traversal
- Iterative Preorder Traversal
- Iterative Depth First Traversal of Graph
- Iterative Preorder Traversal of an N-ary Tree
- Iterative Boundary Traversal of Complete Binary tree
- Iterative diagonal traversal of binary tree
- Implement two stacks in an array
- Merging and Sorting Two Unsorted Stacks