Hi,
I got an iterative version of postorder traversal for a binary tree.
But I guess there must be some better way to implement it, still in
iterative way.
Here comes the code:
void iter_postorder(tree_pointer ptr){
int top = -1;
for(;;){
if(ptr){
for(;ptr;ptr=ptr->left_child){
addstack(&top, ptr);
}
ptr = ptr->right_child;
while(!ptr){
if(stack[top]->right_child){
ptr = stack[top]->right_child;
stack[top]->right_child = NULL;
/*note that the original tree is changed.
if leave it unchanged, we may need to copy this node to a newly malloced
area, and set the right_child to NULL.
anyway, seems a little ugly. */
break;
}
deletestack(ptr);
if(!ptr)
return;
printf("%d", ptr);
}
}
}
}
Thomas.Chang
--~--~---------~--~----~------------~-------~--~----~
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 from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
