Question: Implement a dictionary lookup using Trie data structure/class in JAVA. The program should read the words of a file and place them in tries. It
Implement a dictionary lookup using Trie data structure/class in JAVA. The program should read the words of a file and place them in tries. It should also have 3 other functions: 1. add a word to the trie
2. have an autocomplete feature. The function autocomplete(w) returns a list of words in the trie along with their frequencies so that w is a prefix of each word in the returned list.
3. a function that returns the frequency of a word in the trie (0 if word does not exist in the trie)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
