Self-adjusting binary search trees
Journal of the ACM (JACM)
Introduction to algorithms
Practical data structures in C++
Practical data structures in C++
An evaluation of self-adjusting binary search tree techniques
Software—Practice & Experience
Self-Organizing Binary Search Trees
Journal of the ACM (JACM)
A comparison of tree-balancing algorithms
Communications of the ACM
Performance of height-balanced trees
Communications of the ACM
Data Structures and Algorithms
Data Structures and Algorithms
An empirical evaluation of algorithms for dynamically maintaining binary search trees
ACM '80 Proceedings of the ACM 1980 annual conference
Performance analysis of BSTs in system software
Proceedings of the joint international conference on Measurement and modeling of computer systems
Binary B-trees for virtual memory
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
| Hi-index | 0.00 |
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.