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,

If the tree nodes are doubly-linked, then you don't need a stack.