A spelling dictionary implementation using C++ programming language with self-implemented back-end data structures: hash tables and binary search trees where you can insert words in it and delete them and search for them in a fast efficient way. It was a part of the project made as a course team project for data structures course.
Notes:
- The document named "Question 7" contains the description of the question and what was needed.
- The current model automatically reads more than 31000 words from the provided file "english words" and prompts the user continuously to input a string to search for in the dictionary and answers with "OK" if found or "not found" otherwise.