[algogeeks] Post order traversal of a binary tree without recursion

Hi all, Please let me know if this pseudo code gives correct solution for iterative post-order traversal of a binary tree. void postOrderTraversal(Tree *root) { node * previous = null; node * s = null; push(root); while( stack is not empty ) {

[algogeeks] Post order traversal of a binary tree without recursion

Hi all, Please let me know if this pseudo code solution is correct for iterative post-order traversal of a binary tree. void postOrderTraversal(Tree *root) { node * previous = null; node * s = null; push(root); while( stack is not empty ) { s