A New Method for Balancing Binary Search Trees

Authors:
Salvador Roura
Affiliations:
-
Venue:
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Year:
2001

Citing 6
Cited 3

Self-adjusting binary search trees

Journal of the ACM (JACM)
Randomized binary search trees

Journal of the ACM (JACM)
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
General balanced trees

Journal of Algorithms
Data Structures and Algorithm Analysis in C++

Data Structures and Algorithm Analysis in C++
A dichromatic framework for balanced trees

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science

Towards Optimal Range Medians

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Rank selection in multidimensional data

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Fibonacci BSTs: A new balancing method for binary search trees

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new balancing method for binary search trees is presented, which achieves logarithmic worst-case cost on searches and updates. The method uses the sizes of the subtrees as balancing information; therefore operations by rank are efficiently performed without any changes in the data structure. Compared to weighted binary search trees [7], which also achieve logarithmic worst-case cost by making use of the sizes of the subtrees, the operations involved with our method are likely to be less costly in most real situations.