Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!think.com!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!ucbvax!bloom-beacon!eru!hagbard!sunic!kth.se!cyklop.nada.kth.se!news From: d88-jwa@byse.nada.kth.se (Jon W{tte) Newsgroups: comp.compression Subject: Re: What is a trie ?? (was Re: fast string compr.?) Message-ID: Date: 27 May 91 11:59:17 GMT References: <1991May23.235530.11443@looking.on.ca> <24May91.206106.345@franklin.com> <1991May27.054317.14756@looking.on.ca> Sender: news@nada.kth.se (Mr News) Distribution: comp Organization: Royal Institute of Technology, Stockholm, Sweden Lines: 22 In-reply-to: brad@looking.on.ca's message of 27 May 91 05:43:17 GMT brad@looking.on.ca (Brad Templeton) writes: From: brad@looking.on.ca (Brad Templeton) A trie is nothing fancy, it's a N-ary tree for re"trie"val, and is discussed in Knuth, "Searching and Sorting." Okay, thanx ! (bill@franklin also had a more fleshed-out definition, but as I suspected, I was familiar with the structure, only not the word...) What, you don't have a copy of Knuth? While those pseudo-assembler programs and certain other stuff do make the book a bit dated, it's still one of the fundamental texts of CS. Yeah, there is a reference ex. somewhere here... but I don't have a personal copy, though I imagine the bookstores here carry it as well... -- Jon W{tte h+@nada.kth.se - Speed !