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.
Publication Year: 1978
Publication Date: 1978-10-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 628
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot