Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
PREPRINT. In Proc. Workshop on Algorithms and DataStructures,800 Notes in Computer Science 382,
 

Summary: PREPRINT. In Proc. Workshop on Algorithms and
DataStructures,800 Notes in Computer Science 382,
SpringerVerlag,5439 393­402, 1989.
Improving Partial Rebuilding by Using Simple
Balance Criteria
Arne Andersson
Department of Computer Science
Lund University
Lund, Sweden
Abstract
Some new classes of balanced trees, defined by very simple balance
criteria, are introduced. Those trees can be maintained by partial
rebuilding at lower update cost than previously used weight­balanced
trees. The used balance criteria also allow us to maintain a balanced
tree without any balance information stored in the nodes.
1 Introduction
Partial rebuilding is a general method to maintain balanced tree structures
introduced by Overmars and van Leeuwen [9, 10]. The idea is brutal but
powerful; each time a given balance criterion is violated at a node v we
rebuild the subtree rooted at v to perfect balance. The simplicity of this

  

Source: Andersson, Arne - Department of Information Technology, Uppsala Universitet

 

Collections: Computer Technologies and Information Sciences