This is part of an assignment on data structures course at my university. Weiss source code is used to complete the specified tasks. The filename is inputted by the user. Operations (b) to (h) are performed in binary search tree. The time needed to perform each of the operation should be measured. Tasks are as below:
a. Help
b. Display number of distinct words
c. Display number of occurrences of a particular word
d. Print all words that appear more than some number, inputted by used in a sorted manner.
e. Display the line numbers on which is found a certain word, inputted by the user.
f. Delete the first occurence of a given word.
g. Delete all the occurrences of a given word.
h. Search for a word that doesn't exist in given file.
i) Exit