Using binary tree, you are required to build a program that takes any text
document and produces an index for this document. The index should be as follows:
A
Arithmetic 1,2,10,50
B
Begin 3,7
Below 2
....
p
Program 8,9,12
All the words should be stored alphapatically from 1 to z , ignore the case sensetivity
Along with each word the lines in the document that contain the word
your program should ignore the noise words like "the","on","an"......etc.
The program should allow the user to enter any document , then build the binary tree for
that document ; search for any word. A print for the whole index should also be possible.