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

› Category: Questions › A program to search a contact from phone directory can be implemented efficiently using ______
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months 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.

Question Tags:
1 Answers
0 Vote Up Vote Down
Editor">Editor Staff answered 5 months 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.


Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40702

Related Posts