Implementation of a retrieval tree, that is a prefix tree, with hash table and multiplication method as hash function.
This is an example:
- The algorithm get the words from an input file, and word for word, it places the word in the correct place in the tree, so the words that share the same prefix will have the same branch.
- Throgh the command line we now can lunch the algorithm with the command: ./main [file of words].[txt] [word to search]