Question
Please help me create this program to the best of your abilities. I also attached a dropbox link for two .cpp files to show how we write our programs. One is for the classes and one is for BST. Thank you.
https://www.dropbox.com/sh/ig6fr2syhme0zw5/dS89ELuZWD
Design and implement a class called TextScarch. The goal is to read a file into a Binary Search Tree (BST) data structure and provide search capabilities. Assume that the text file only contains English alphabets, spaces and periods. A space (including an end of line) indicates a word. A period indicates end of a sentence. A user may want to search for one word or a phrase of up to 10 words. Provide functionalities in your class to find and replace or delete one word or a phrase of up to 10 words. Solve the problem in the following way: Read the file and create a BST with each node containing only one word. At each node, store an ordered sequence of the next 9 words (that form an at most 10 word phrase) from the input file. Use a linked list here to conserve memory. For words that repeat at different sections in the file, you can have multiple lists originating from a single word in the BST, each keeping track of different phrases. Assume that a word does not occur more than 20 times in a given file. Absolutely no global variables anywhere in your code! Implement the following: Constructors (one of which reads a particular file and creates the data structure) and a destructor Overloaded copy constructor. Overloaded assignment operator. Read a file and create the tree: bool read(string); Search if a word exists: bool exists(string); Return the number of times a word occurs (case insensitive): int n_words(string); Return the number of times a phrase occurs (case insensitive): int n_phrase(string); Replace every occurrence of a particular word or a phrase with another word or a phrase: bool replace(string, string); Return the number of words in the file: int word_count(string); Write the current contents of the BST into another file reflecting the changes made: bool write(string); Use const keyword wherever appropriate. Write a modular main function (that is, with functions) to demonstrate all the features. The main function does not need to interact with the user. Simply demonstrate all the features.
Explanation / Answer
Ok will do
