Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!zaphod.mps.ohio-state.edu!magnus.ircc.ohio-state.edu!tut.cis.ohio-state.edu!junk.cis.ohio-state.edu!martens From: martens@junk.cis.ohio-state.edu (Jeff Martens) Newsgroups: comp.sys.amiga.programmer Subject: Re: tree traversal Summary: asshole Keywords: non-recursive tree traversal algorithm needed Message-ID: <88922@tut.cis.ohio-state.edu> Date: 27 Feb 91 13:55:42 GMT References: <1991Feb26.045024.6487@ux1.cso.uiuc.edu> Sender: news@tut.cis.ohio-state.edu Reply-To: Jeff Martens Organization: Ohio State University Computer and Information Science Lines: 27 In article <1991Feb26.045024.6487@ux1.cso.uiuc.edu> andreess@mrlaxs.mrl.uiuc.edu (Marc Andreessen) writes: %In article 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. %This is a blatant attempt by a student in CS225 here at UIUC %to farm out his homework to the net. The question given in class %(and due 26 Feb) is 3.19 from _Data Structures and Algorithms_ %(Aho, Hopcraft, Ullman): %"Suppose trees are implemented by leftmost-child, right-sibling, %and parent pointers. Give nonrecursive preorder, postorder, and %inorder traversal algorithms that do not use 'states' or a stack." %Thought you'd like to know... I certainly hope someone brings this to the attention of the original slimeball poster's instructor, or at least reposts the original request on a UIUC CS newsgroup, assuming they have such a thing. -- -- Jeff (martens@cis.ohio-state.edu) Scissors cut paper, rock breaks scissors, and guy stuff beats girl stuff.