Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!cs.utexas.edu!uunet!tekbspa!tss.com!yost
From: yost@tss.com (Dave Yost)
Newsgroups: comp.theory
Subject: what to call this kind of tree traversal
Message-ID: <1991Apr2.014125.21190@tss.com>
Date: 2 Apr 91 01:41:25 GMT
Sender: news@tss.com (USENET Network News)
Reply-To: yost@netcom.COM
Organization: Teknekron Software Systems, Inc.
Lines: 24

Is there a standard name for a tree traversal that
  * visits the node
  * traverses the children, if any
  * visits again
Sort of a combination of preorder and postorder.

I just wrote a generic tree traverser that lets
the user specify the traversal "phases" of interest:
   before,
   after, or
   both before and after

The application was one that printed out a nested
C struct declaration, so it needed to pause once
to print out the
    struct {
then traverse the children, and then pause again
to print the
    };

I've looked in several of the standard references
and can't find a name for this.

 --dave yost