A program to search a contact from phone directory can be implemented efficiently using ______

Category: QuestionsA program to search a contact from phone directory can be implemented efficiently using ______
Editor">Editor Staff asked 1 month ago

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 Answers
Editor">Editor Staff answered 1 month ago

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.