To make a binary seach tree- spellchecker in C++

Dictionary

Your next program should use a binary search tree to create a dictionary. Read the words from a file, then add them to the tree.

Your program should read a paragraph from a file, check each word to see if it is in the dictionary (in the tree). If not, add to the array of misspelled words.

When finished processing the paragraph, print

1. The paragraph

2. The dictionary

3. The misspelled words

Submit a sample paragraph and dictionary file with your program.

Examples: dictionary

I like green apple corn money him her we you red

Paragraph: Do you like green eggs and ham. I do not lik green eggs and ham.

Misspelled: Do and eggs ham not lik