Binary Tree PostOrder traversal in java

Previous
Next

If you want to practice data structure and algorithm programs, you can go through Top 100+ data structure and algorithm interview questions.

This is 3rd part of java binary tree tutorial.

Table of Contents


In this post, we will see about PostOrder binary tree traversal in java.

PostOrder traversal

In PostOrder traversal, each node is processed after subtrees traversal.In simpler words,Visit left subtree,  right subtree and then node.
Steps for PostOrder traversal are:
  • Traverse the left subtree in PostOrder.
  • Traverse the right subtree in PostOrder.
  • Visit the node.

There can be two ways of implementing it

  • Recursive
  • Iterative

Recursive solution

Recursive solution is very straight forward.Below diagram will make you understand recursion better.

Code for recursion will be:

Iterative solution:

Steps for iterative solution:

  1. Create an empty stack s and set currentNode =root.
  2. while currentNode is not NULL Do following
    1. Push currentNode 's right child and then currentNode to stack s
    2. Set currentNode=currentNode.left
  3. Pop a node from stack s and set it to currentNode
    1. If the popped node has a right child and the right child is at top of stack, then remove the right child from stack, push the currentNode back and set currentNode as currentNode 's right child.
    2. Else print currentNode's data and set currentNode as NULL.
  4. Repeat steps 2 and 3 while stack is not empty.

Lets create java program for postOrder traversal:

Run above program and you will get following output:

Using Recursive solution:
10 30 20 50 70 60 40
————————-
Using Iterative solution:
10 30 20 50 70 60 40

Java Binary tree tutorial

Please go through java interview programs for more such programs.

Previous
Next

One Response

  1. Max March 20, 2016

Add Comment