Iterative post-order traversal

In this article, we have explained how to do Iterative post-order traversal of a Binary Tree using 3 different techniques along with complete implementation.

Basics:

A binary search tree is a tree data structure where the key values of nodes in the left subtree are smaller than the key value of the root and the values of nodes in the right subtree are greater than the key value of the root.A tree traversal is visiting all the nodes in the tree exactly once. A post-order traversal is traversing...