Looking for a good introduction on trie [closed]

Answer 1

Sure, have a look at Steve Hanov's site, like Fast and Easy Levenshtein distance using a Trie.

Answer 2

I've recently coded up a Trie and Patricia Trie in Java. They are written to be easy to follow. All the data structures were built from their Wikipedia descriptions.

Related classes: Radix Trie, Suffix Trie, Trie Map.

If you have any questions, feel free to ask.

Answer 3

I recommend Stefan Nilsson's Ph.D. thesis from 1996, Radix Sorting & Searching (The searching part is what you are looking for.) It is quite an easy read for a research publication and contains a lot of both theory and practice about tries.

The examples are in C, not Java, but you shouldn't have much trouble understanding them if you know Java.

Answer 4

Googling found this blog with a series of articles in Java.

But I'd recommend buying a text book. Lots of Java oriented books on Data Structures and Algorithms are available from your favourite online bookstore.

Answer 5

Found this topcoder link on trie quite useful :

http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=usingTries