Recursive to Iterative algorithms

hi. is it possible to write an iterative version of the post-order and in-order binary tree traversal algorithms? I know how to do the one for preorder using stacks, but I can't get my head around the other two.

please help
friend,

It's really simple: think of how you would implement each traversal using recursion, then substitute a stack with push on entry and pop on exit for each call.

Which is exactly how it's done at machine level (at least without tail recursion removal).