Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!cs.utexas.edu!uunet!looking!brad From: brad@looking.on.ca (Brad Templeton) Newsgroups: comp.compression Subject: Re: What is a trie ?? (was Re: fast string compr.?) Message-ID: <1991May27.054317.14756@looking.on.ca> Date: 27 May 91 05:43:17 GMT References: <1991May23.235530.11443@looking.on.ca> <24May91.206106.345@franklin.com> Distribution: comp Organization: Looking Glass Software Ltd. Lines: 8 A trie is nothing fancy, it's a N-ary tree for re"trie"val, and is discussed in Knuth, "Searching and Sorting." 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. -- Brad Templeton, ClariNet Communications Corp. -- Waterloo, Ontario 519/884-7473