how to solve post - order traversal without using recursion ?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe fr
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 )
{
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