Retrieval Tree Optimization #7
Description
The Retrieval tree can be optimized by:
- Having each node storing a value and the best value of its substring, so that the tree will not have to loop through all of its children, but instead look for children in the order of "best".
- using a priority queue to implement the feature.