From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,7baa6e737458747f,start X-Google-Attributes: gid103376,public From: Ehud Lamm Subject: Re: digital search trees Date: 2000/05/08 Message-ID: #1/1 X-Deja-AN: 620715756 References: <3916E75B.A150925C@student.ecu.edu.au> Content-Type: TEXT/PLAIN; charset=US-ASCII X-Complaints-To: usenet@news.huji.ac.il X-Trace: news.huji.ac.il 957803180 23606 132.64.178.45 (8 May 2000 16:26:20 GMT) Organization: The Hebrew University of Jerusalem Mime-Version: 1.0 NNTP-Posting-Date: 8 May 2000 16:26:20 GMT Newsgroups: comp.lang.ada Date: 2000-05-08T16:26:20+00:00 List-Id: On Tue, 9 May 2000, Gerald Ang wrote: |hey guys, anyone knows anything about digital search trees or knows |where I can find the resource!!! | What'd you want to know? Another term to searcg for is "TRIE." There are plenty examples on the web - but I didn't find any example code in Ada. Aho, Hopcroft, Ullman "Data Structures and Alogrithms" cover the topic nicely. You can use the links from my pages to data strcuture texts etc. for more. One link: http://hissa.nist.gov/dads/HTML/trie.html If you need more help -ask. Ehud Lamm mslamm@mscc.huji.ac.il http://purl.oclc.org/NET/ehudlamm <== My home on the web Check it out and subscribe to the E-List- for interesting essays and more!