From: Ehud Lamm <mslamm@mscc.huji.ac.il>
Subject: Re: digital search trees
Date: 2000/05/08
Date: 2000-05-08T16:26:20+00:00 [thread overview]
Message-ID: <Pine.A41.3.96-heb-2.07.1000508192056.57106D-100000@pluto.mscc.huji.ac.il> (raw)
In-Reply-To: 3916E75B.A150925C@student.ecu.edu.au
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!
next prev parent reply other threads:[~2000-05-08 0:00 UTC|newest]
Thread overview: 9+ messages / expand[flat|nested] mbox.gz Atom feed top
2000-05-09 0:00 digital search trees Gerald Ang
2000-05-08 0:00 ` Ehud Lamm [this message]
2000-05-09 0:00 ` yahoo
2000-05-09 0:00 ` Gerald Ang
2000-05-09 0:00 ` Robert Dewar
2000-05-10 0:00 ` yahoo
2000-05-09 0:00 ` Robert Dewar
2000-05-10 0:00 ` yahoo
2000-05-13 0:00 ` Larry Kilgallen
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox