RWTH Aachen University
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure. In the authors' previous work, they have implemented top trees, but the usage still requires a detail knowledge of the structure which is quite complex. In this paper, they introduce Top tree Friendly Language (TFL) and Top tree Query Language (TQL). The TFL is a special programming language which combines declarative and procedural approaches that results in simpler and faster algorithm designing.