Auto complete and spell checkers can be implemented efficiently using the trie.

Category: QuestionsAuto complete and spell checkers can be implemented efficiently using the trie.
Editor">Editor Staff asked 1 month ago

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

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.