+1 vote
in Data Structures & Algorithms I by (88.2k points)
A program to search a contact from phone directory can be implemented efficiently using ______

(a) a BST

(b) a trie

(c) a balanced BST

(d) a binary tree

My question is based upon Trie in division Trie of Data Structures & Algorithms I

I had been asked this question in class test.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct choice is (b) a trie

To explain: Dictionaries, phone directories can be implemented efficiently using the trie. Because it trie provides the efficient linear time searching over the entries.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...