One of the most widely used spelling checkers in unix-like environments isispell, written by our own Professor Kuenning. Is Professor Kuenning's fame and glory deserved? Just how hard is it to write a spelling checker? It's time to find out!

This week, you’ll use a balanced binary search tree to implement the interface for a spell checker.

As with any piece of software, you'll need to test and document as you go.

Readings

In addition to reading this assignment, we strongly recommend the following resources:

• The wiki page on reading input
• The wiki page on processing command line arguments
• The Homework 6 clarifications wiki page, where we will collectively accumulate clarifications and useful advice for the assignment. You should definitely check this before you start the assignment, and may want to check back periodically (especially if you're having trouble with something in the assignment).

Grading

Your submission will be graded as follows:

• 17 points: correctness
• 10 points: completeness
• 6 points: style
• 6 points: elegance
• 6 points: clarity
• 5 points: peer review

See the Grading Guidelines wiki page for more information about what we're looking for in each of those categories.