We can work on A trie, also known as a prefix tree, is a tree-based data structure that stores key/value pairs (like a HashMap). The keys in tries are usually strings. In this assignment, you will implement a trie data structure that uses recursion to store string keys and their associated string values. The root node in the trie

Assignment 5 RecursionSubmit a single ZIP file called assignment 5.zip containing each of your Java files. Your zip file must contain only .java files organized into a single folder (i.e., no packages, sub-folders, etc.) and theTAs should be able to compile all your code within this same folder (i.e., your code should also not referenceRead more about We can work on A trie, also known as a prefix tree, is a tree-based data structure that stores key/value pairs (like a HashMap). The keys in tries are usually strings. In this assignment, you will implement a trie data structure that uses recursion to store string keys and their associated string values. The root node in the trie[…]