/* Trie is also called as 'Prefix Tree'. It is a tree data structure which is commonly used to store the strings/words. The popoular applications of this data stucture are autocomplete and spellcheck.

The project involves writing Java classes to implement a trie that supports efficient word lookup in a dictionary. The implementation requires at least two classes: TrieNode and Trie. The trie must ...

I've had this assignment over my head for months. I didn't finish it on time for one of my classes, so I pretty much abandoned it- planning to come back to it after the semester and get things working ...