See mmn15.pdf
- Read files
- Dictionary must contain at least 50 words
- Place dictionary in hashmap
- [] Explain which hashmap type chosen, and explain why this one specifically
- [] Analyze the time complexity of the hashmap algorithm
- [] Place text file in red-black tree
- [] Remove from tree any word that is in the dictionary
- [] Print remaining words from tree (these are incorrectly spelled words)