H-Tree: A data structure for fast path-retrieval in rooted trees.

When repeatedly searching on a depth-first or breath-first search fashion, some nodes are visited many times, as every search requires to start at the root. By providing a way to arrange the data in a different manner and using a hash table as the primary data structure, it is possible to get average lookup times of a path, from the root to any node in constant time, although a disadvantage arises when looking at the memory needs of the approach. We propose a structure called H-tree created to reduce the time to extract a path from a rooted tree.