Data Structures project 4
Due before our final exam.  No projects accepted after the final.

A spell-checker.

Functionality:

  • Build a dictionary from a text file. Implement the dictionary as an AVL tree.  (Build a binary search tree implemented as an AVL tree to perform height balancing.)
  • Allow the user to enter the name of a text file and spell check the file, marking words which are not in the dictionary.
  • should be able also to add a word to the dictionary
  • delete a word from the dictionary
  • overloaded << to output the dictionary in alphabetical order

    •