Binary tree post order traverse without recursion in Java
Post order traversal In PostOrder traversal, the left node is processed first, the right node (subtree), then the node. Steps for post order are: 1. Process left subtree. 2. Process right subtree. 3. Process the node. I will consider processing the node is just printing out its value on screen. Consider the below binary tree Processing the above tree in post order should result the following: 1, 4, 6, 2, 12, 45, 40, 10, 75, 60, 50 The recursive solution is very straight forward by following the above steps: public void postOrderTravesalRecursion(){ postOrderTravesalRecursion(this.root); } private void postOrderTravesalRecursion(Node node){ if(node==null){ return; } postOrderTravesalRecursion(node.getLeft()); postOrderTravesalRecursion(node.getRight()); System.out.println(node); } Doing the same without usi