Implement the Dictionary Using Array, Linked List, and Trie
Budget: $30 – $250 AUD
implement a dictionary of English words that allows Add, Search, Delete, and Auto-completion, using three different data structures: Array (Python’s list), Linked List, and Trie. Each implementation should support the following operations:
• Build a dictionary from a list of words and frequencies: create a dictionary that stores words and frequencies taken from a given list. This operation is not tested.
- Add a word and its frequency to the dictionary. Return True if successful or False if it already exists in the dictionary.
- Search for a word in a dictionary and return its frequency. Return 0 if not found. 4
- Delete a word from the dictionary. Returns True if successful and False if it doesn’t exist in the dictionary.
- Auto-complete a given string and return a list of three most frequent words (if any) in the dictionary that have the string as a prefix. The list can be empty.
• Build a dictionary from a list of words and frequencies: create a dictionary that stores words and frequencies taken from a given list. This operation is not tested.
- Add a word and its frequency to the dictionary. Return True if successful or False if it already exists in the dictionary.
- Search for a word in a dictionary and return its frequency. Return 0 if not found. 4
- Delete a word from the dictionary. Returns True if successful and False if it doesn’t exist in the dictionary.
- Auto-complete a given string and return a list of three most frequent words (if any) in the dictionary that have the string as a prefix. The list can be empty.