Is it possible to traverse (ie visiting every node) a tree without using recursion? If yes, could you please outline the algorithm?

[sorry I inadvertently posted it twice]