Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!zaphod.mps.ohio-state.edu!uwm.edu!ux1.cso.uiuc.edu!mrlaxs.mrl.uiuc.edu!andreess From: andreess@mrlaxs.mrl.uiuc.edu (Marc Andreessen) Newsgroups: comp.sys.amiga.programmer Subject: Re: tree traversal Keywords: non-recursive tree traversal algorithm needed Message-ID: <1991Feb26.045024.6487@ux1.cso.uiuc.edu> Date: 26 Feb 91 04:50:24 GMT References: Sender: usenet@ux1.cso.uiuc.edu (News) Organization: University of Illinois, Urbana Lines: 24 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... Marc -- Marc Andreessen___________University of Illinois Materials Research Laboratory Internet: andreessen@uimrl7.mrl.uiuc.edu____________Bitnet: andreessen@uiucmrl