Trie Data Structure in Java - Phone Book Application

Question

We are building a Phone book (Contacts) application and i have just googled on the net and found a useful data structure to use for the phone book application which is TRIE.

Could you please guide/suggest links such that we can implement a Phone book application using Trie data Structure.

Im a new bie to Data Structure and Algorithms in Java,Please consider this as my request to help me out.

Im unable to proceed as to whether it is really possible to implement it using TRIE data Structure or not?

Answer 1

You should have your address book in any format needed, and use Trie to index it for search only.

See Trie data structures - Java

and Trie implementation

for some Java implementations.

EDIT:

and this: http://www.codeproject.com/KB/recipes/PhoneDirectory.aspx

Answer 2

Checkout a previous question here on stackoverflow: Where do I find a standard Trie based map implementation in Java?

There are a few links in there that might help you out. Other useful links might be the following: http://wikipedia-clustering.speedblue.org/trieJava.php or http://www.technicalypto.com/2010/04/trie-in-java.html