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

2007-09-10 Thread adak
For which ACM contest? They have regional events world-wide, and then of course, the finals in Alberta, Canada next year. For the latter, click here: http://icpc.baylor.edu/icpc/ For an explanation of one competition, go here: http://online-judge.uva.es/contest/running.html Enjoy! --~--~-

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

2007-09-10 Thread mirchi
can any one please tell me how to submit problems in the new acm site? i am not able to figure it out !!! On Sep 10, 8:50 pm, "chandra kumar" <[EMAIL PROTECTED]> wrote: > Hi, >You are right. Thank you for the correction. Actually the error is > because of the ignorance of the fact that no

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

2007-09-10 Thread chandra kumar
Hi, You are right. Thank you for the correction. Actually the error is because of the ignorance of the fact that not only the info about the left and right child are important but also the order in which the elements in the stack are pushed. So instead of having two stacks, this can be imple