Is there a name for this tree traversal?
For a binary tree that is triple order; each node is visited three times in pre- in- and post-order.  Knuth cites it from a paper by Lindstrom and Dwyer; it can be done without a stack by updating the tree in place.