Given a binary tree, write iterative and recursive solution to traverse the tree using post-order traversal.

Unlike linked lists, one-dimensional arrays and other linear data structures, which are traversed in linear order, trees may be traversed in multiple ways in depth-first order (post-order, pre-order and post-order) or breadth-first order (level order traversal). Beyond these basic traversals, various more complex or hybrid schemes are possible, such as depth-limited searches like iterative deepening depth-first search.

In this post, **postorder tree traversal** is discussed in detail.

Traversing a tree involves iterating over all nodes in some manner. As tree is not a linear data structure, from a given node there can be more than one possible next node, so some nodes must be deferred i.e stored in some way for later visiting. The traversal can be done iteratively where the deferred nodes are stored in the stack or it can be done by recursion where the deferred nodes are stored implicitly in the call stack.

For traversing a (non-empty) binary tree in post-order fashion, we must do these three things for every node N starting from root node of the tree:

**(L)**Recursively traverse its left subtree. When this step is finished we are back at N again.

**(R)** Recursively traverse its right subtree. When this step is finished we are back at N again.

**(N)** Process N itself

In normal post-order traversal we visit left subtree before the right subtree. If we visit right subtree before visiting the left subtree, it is referred as reverse post-order traversal.

As we can see before processing any node, the left subtree is processed first, followed by the right subtree and the node is processed at last. These operations can be defined recursively for each node. The recursive implementation is referred to as depth-first search (DFS), as the search tree is deepened as much as possible on each child before going to the next sibling.

**C++ implementation –**

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
// Recursive function to perform post-order traversal of the tree void postorder(Node *root) { // if the current node is empty if (root == nullptr) return; // Traverse the left subtree postorder(root->left); // Traverse the right subtree postorder(root->right); // Display the data part of the root (or current node) cout << root->data << " "; } |

**Iterative implementation –**

To convert above recursive procedure to iterative one, we need an explicit stack. Below is a simple stack based iterative algorithm to do post-order traversal.

**iterativePostorder(node)**

s -> empty stack

t -> output stack

while (not s.isEmpty())

node -> s.pop()

t.push(node)

if (node.left <> null)

s.push(node.left)

if (node.right <> null)

s.push(node.right)

while (not t.isEmpty())

node -> t.pop()

visit(node)

**C++ implementation –**

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 |
// Iterative function to perform post-order traversal of the tree void postorderIterative(Node* root) { // create an empty stack and push root node stack<Node*> stk; stk.push(root); // create another stack to store post-order traversal stack<int> out; // run till stack is not empty while (!stk.empty()) { // we pop a node from the stack and push the data to output stack Node *curr = stk.top(); stk.pop(); out.push(curr->data); // push left and right child of popped node to the stack if (curr->left) stk.push(curr->left); if (curr->right) stk.push(curr->right); } // print post-order traversal while (!out.empty()) { cout << out.top() << " "; out.pop(); } } |

The time complexity of above solutions is O(n) and space complexity of the program is O(n) as space required is proportional to the height of the tree which can be equal to number of nodes in the tree in worst case for skewed trees.

**References:**

https://en.wikipedia.org/wiki/Tree_traversal

**Exercise:** Do iterative post-order traversal using only one stack.

**Thanks for reading.**

Please use ideone or C++ Shell or any other online compiler link to post code in comments.

Like us? Please spread the word and help us grow. Happy coding 🙂