A dichromatic framework for balanced trees
- 1 October 1978
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 8-21
- https://doi.org/10.1109/sfcs.1978.3
Abstract
In this paper we present a uniform framework for the implementation and study of balanced tree algorithms. We show how to imbed in this framework the best known balanced tree techniques and then use the framework to develop new algorithms which perform the update and rebalancing in one pass, on the way down towards a leaf. We conclude with a study of performance issues and concurrent updating.Keywords
This publication has 7 references indexed in Scilit:
- A Partial Analysis of Random Height-Balanced TreesSIAM Journal on Computing, 1979
- Minimal-Comparison $2,3$-TreesSIAM Journal on Computing, 1978
- A storage scheme for height-balanced treesInformation Processing Letters, 1978
- On random 2?3 treesActa Informatica, 1978
- Performance of height-balanced treesCommunications of the ACM, 1976
- Organization and maintenance of large ordered indexesActa Informatica, 1972
- Symmetric binary B-Trees: Data structure and maintenance algorithmsActa Informatica, 1972