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?

It seems like you're trying to make the solution (the Trie datastructure) fit some nebulous problem. Define the precise problem and then see what solutions make sense. — GaryF
– GaryF, Commented Dec 11, 2010 at 16:32
-1: It seems the guy is looking just for the code. Check out his discussion with Goran Jovic in one of the answers below. — user183037
– user183037, Commented Feb 22, 2011 at 16:58

Community · Accepted Answer · 2017-05-23 11:53:29Z

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

edited May 23, 2017 at 11:53

CommunityBot

11 silver badge

answered Dec 11, 2010 at 14:51

Goran Jovic

9,5283 gold badges47 silver badges76 bronze badges

Sign up to request clarification or add additional context in comments.

7 Comments

Deepak Over a year ago

@Goran,Thank you for ur concern,any links you can suggest which can be helpful to implement this since i have to do it from sratch development in java

Goran Jovic Over a year ago

@Deepak: I suppose you already have your address book implemented. So, all you need is a trie, where each node references your addres book entries somehow (by id, pointing to an object.. that depends on your implementation)

Deepak Over a year ago

@Goran,Thanks for your concern,In case you find the real implementation for contact based application.,Please share the link

Goran Jovic Over a year ago

@Deepak: NP, if I run into it, I'll remember to do so. Meanwhile, try googling for it. You already have the keywords.

Deepak Over a year ago

@Goran,I know its bad to ask for answers on this forum,but its difficult to implement a phone based (contacts) application with searchByName and SearchByNumber facility using Trie data Structure,Anyone who has already implemented it.Please share your Advice/Suggestions/Link/Code

|

Community · Accepted Answer · 2017-05-23 11:45:28Z

1

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

edited May 23, 2017 at 11:45

CommunityBot

11 silver badge

answered Dec 11, 2010 at 15:01

Tim

8317 silver badges7 bronze badges

1 Comment

Tim Over a year ago

Btw, also check out the 'related' questions at the right of this page. They might very well help you out too.

Collectives™ on Stack Overflow

Trie Data Structure in Java - Phone Book Application

2 Answers 2

7 Comments

1 Comment

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

7 Comments

1 Comment

Your Answer

Sign up or log in

Post as a guest

Linked

Related