homework

Your program should do the following: 1 Ask the user for the name of a text file and open it to read. 2 Read the file, split it apart into individual words, and insert the words into a binary search tree. With each word will be kept a frequency count (how many times the word appears in the input), and when duplicate words are encountered, the frequency count will be increased. The same word will not be inserted twice in the tree. 3 Print out all the words in the data structure, in alphabetical order, with their frequency counts. 4 Put everything in parts 1-3 into a while loop that will run as many times as the user wishes. Thus, the user can add on to the binary search tree with more than one file if desired. 5 Use Sample code below for overloading the output (stream-insertion) operator. You will also have to overload the less than < operator // Assuming Comparable is the class that you have defined // with private variables for the word and frequency. class Comparable { friend ostream &operator<<(ostream &, const Comparable &) ; : : : } ; ostream &operator<<(ostream &output, const Comparable &w) { output << [login to view URL]() << " " << [login to view URL]() ; return output ; } What is a word: A word is defined as a sequence of letters, together with apostrophes (') and hyphens (-), provided that the apostrophe or hyphen is both immediately preceded and followed by a letter. Uppercase and lowercase letters should be regarded as the same (by translating all letters into either uppercase or lowercase, as you prefer). A word is to be truncated to its first 20 characters (that is, only 20 characters are to be stored in the binary search tree) but words longer than 20 characters may appear in the text. Nonalphabetic characters (such as digits, blanks, punctuation marks, control characters) may appear in the text file. The appearance of any of these terminates a word, and the next word begins only when a letter appears. You can download BinarySearchTree.h and [login to view URL] from the textbook source code website (you can find the link on the course web page). Once again, you cannot edit the BinarySearchTree.h and [login to view URL] files. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Also use the files provided and makes sure it all works together. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased. 4) Follow instructions exactly. ## Platform Visual C++ 6.0 ## Deadline information Must be complete by 10/24/02 10:00:00 PM