+1 vote
in Data Structures & Algorithms I by (88.2k points)
Auto complete and spell checkers can be implemented efficiently using the trie.

(a) True

(b) False

Enquiry is from Trie in portion Trie of Data Structures & Algorithms I

This question was posed to me during an interview for a job.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct answer is (a) True

Explanation: Trie provides fast searching and storing of the words. And tries stores words in lexicographical order so, trie is the efficient data structure for implementation of spell checkers and auto complete.

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.