void postorder(NODE tree) { struct stack { int top; NODE item[MAX]; }s; NODE p; s.top=-1; p=tree; do { while(p!=NULL) { push(s,p); p=p->left; } if(!empty(s) { p=pop(s); p=p->right; printf("%d",p->info); } } while(!empty(s) || p!=NULL) }
On Wed, Jun 30, 2010 at 8:49 PM, UMESH KUMAR <kumar.umesh...@gmail.com>wrote: > Hello everybody, > > Write a Code in C/C++ *Iterative * for Traversing BST (Binary Tree) > *POSTORDER *,this is my Problem. > > > > > > > > Thanks and regards > Umesh Kumar from > D.U. > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.