Trie on Data Structure and Algorithms related Questions and Answers


Question :   A program to search a contact from phone directory can be implemented efficiently using ______
1. a BST
2. a trie
3. a balanced BST
4. a binary tree
Answer :   2 - a trie  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter