I can't think of an easy way to do nonrecursive traversal without a lifo queue.<P> All the methods Google finds use stacks or similar data structures to keep track of where they are.<P>Then again ...