A Dichromatic Framework for Balanced Trees

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.

Authors

• Leonidas J. Guibas
• Robert Sedgewick

Keywords

• Computer science
• Petroleum
• Particle measurements
• Algorithm design and analysis
• Performance analysis
• Balanced Tree
• Path Length
• Average Cost
• Tree Structure
• Tree Height
• Subtree
• Binary Tree
• Program Execution
• Family Tree
• Search Costs
• Node Color
• Bottom Level
• Local Balance
• Red Nodes
• Single Rotation
• Tree Attributes
• Balancing Algorithm
• Path Tree
• External Nodes