ASD3 project:

Goal: The goal of this project is to use binary search trees to index a given text file. This tree contains the different words of the text file with the occurrences of the words in the file (position of the word in the sentences of the file).

That is to say, these words of the text will be the indexes, and for each word we associate the list of occurrences of the word in the file (the number of sentences where these words appear). If a word is present

several times in a sentence, it is counted only once, the sentence is considered only once.

Searching for a phrase in a text (in the text file) amounts to making the intersection of the list of positions of the words of the phrase in the binary search tree.

1. Create this structure,
2. Build the search tree, (search for a word, insert a word if it does not exist,..)
3. - Create the list of positions, - be able to add positions to it, make the intersection of two list (list in common), which checks if an element exists in this list...
4. Search for a phrase in the text.