Counting the Words

Your task is simple. I will provide you with a text document. You will read every word of that document and tell me which words are most common.

Your output will look something like this:

the: 8127

of: 6125

for: 513

expectorate:2

Alphabetically highest word: Zebra

Alphabetically lowest word: Aardvark

You must use a binary tree in your code. Each element of the tree will look like this:

class word

{

int count; // How many uses found of this word

String word; // What is the word

word *higher, *lower; // A pointer to two subtrees, containing other words

}

You may use a dummy head node if you want.

Points	Task
10	Has a binary tree that knows word to add a word and count words.
2	Can print the alphabetically highest and lowest words found (using the binary tree).
5	Can read its input from a file.
10	Can print the words in order alphabetically
10	Can print the words in order by count,
8	Turned in on or before Thursday October 3^rd.
-8	Turned in after Wednesday, October 9^th.