✍ Scribed by Štrbac-Savić, Svetlana; Tomašević, Milo
No coin nor oath required. For personal study only.
The AVL and red-black trees are the suboptimal variants of the binary search trees which can achieve the logarithmic performance of the search operation withot an excessive cost of the optimal balancing. After presenting a brief theoretical background, the paper comparatively evaluates the performance of these two structures. The evaluation was performed by means of simulation with a synthetic workload model. In order to obtain a better insight, the performance indicators are chosen to be implementation and platform independent. Some representative results of the evalution are given and discussed. Finally, the findings of this study are summarized into the suggestions for an optimal use of the analyzed trees.
📜 SIMILAR VOLUMES
Question Answering Systems (QAS) are an important research topic triggered and at the same time stimulated by the immense amount of texts available in digital form. As the quantity of natural language information increases, the necessity of new methods to precisely retrieve the exact information fro