问题
I am looking for a good introduction/tutorial on Tries.
Most of the links I find googling are either too succint and abstract for me or too trivial.
Could someone please provide a good reference with examples in Java for me to study?
Thanks
回答1:
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.
回答2:
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.
回答3:
Sure, have a look at Steve Hanov's site, like Fast and Easy Levenshtein distance using a Trie.
回答4:
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.
回答5:
Found this topcoder link on trie quite useful :
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=usingTries
来源：https://stackoverflow.com/questions/10684646/looking-for-a-good-introduction-on-trie