The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
Upper Bounds for the Total Path Length of Binary Trees
Journal of the ACM (JACM)
Binary Search Trees and File Organization
ACM Computing Surveys (CSUR)
A comparison of tree-balancing algorithms
Communications of the ACM
Performance of height-balanced trees
Communications of the ACM
Communications of the ACM
Data Structures: Theory and Practice
Data Structures: Theory and Practice
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
A programming language
Performance analysis of BSTs in system software
Proceedings of the joint international conference on Measurement and modeling of computer systems
Comparative performance evaluation of the AVL and red-black trees
Proceedings of the Fifth Balkan Conference in Informatics
Hi-index | 0.00 |
Algorithms for dynamically maintaining and utilizing binary search trees are empirically compared and evaluated. The evaluation is based on the performance of the algorithms using simulated search requests. Search keys are generated using weights which are unknown and in general unequal. The algorithms provide for inserting new nodes, searching for existing nodes, and in some cases dynamically modifying the tree in an attempt to reduce its weighted path length or search time. Included in the evaluation are algorithms for height-balanced trees, weight-balanced trees, and trees of bounded balance, as well as some combination algorithms. Also included are a basic search algorithm which performs no rebalancing, and an optimizing algorithm. In addition to the standard data, unweighted search keys, specially weighted search keys, and partially ordered key sequences are also considered. The evaluation is based primarily on the execution times of the algorithms, although weighted path lengths are also given. A combination algorithm gives the fastest speeds, although the basic search algorithm is shown to be the best for most purposes.