Path: utzoo!mnetor!tmsoft!torsqnt!news-server.csri.toronto.edu!bonnie.concordia.ca!nstn.ns.ca!cs.dal.ca!ug.cs.dal.ca!dewolfe
From: dewolfe@ug.cs.dal.ca (Colin DeWolfe)
Newsgroups: comp.sys.amiga.programmer
Subject: Re: tree traversal
Keywords: non-recursive tree traversal algorithm needed
Message-ID: <1991Feb25.040918.18633@cs.dal.ca>
Date: 25 Feb 91 04:09:18 GMT
References: <anderson.667437145@mrcnext>
Sender: news@cs.dal.ca (USENET News)
Organization: Math, Stats & CS, Dalhousie University, Halifax, NS, Canada
Lines: 19
Nntp-Posting-Host: ug.cs.dal.ca

In article <anderson.667437145@mrcnext> anderson@mrcnext.cso.uiuc.edu writes:
>I need _non-recursive_ pre, post and inorder tree traversal algorithms.
>
>The trees are implemented with leftmost-child, right-sibling and parent
>pointers.
>
>Please, no algorithms which use "states" or a stack.
>

I hate to do it, but ME TOO!!!  I need one with parent, leftmost-child,
and right AND left sibling pointers...  as above, no states or stack...

>Thanks,
>-Beej

Hey Beej, I wonder if were doing the same project?
--
Colin (Clone) DeWolfe
dewolfe@ug.cs.dal.ca