Summary: PREPRINT. In Proc. Workshop on Algorithms and
DataStructures,800 Notes in Computer Science 382,
SpringerVerlag,5439 393402, 1989.
Improving Partial Rebuilding by Using Simple
Department of Computer Science
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 weightbalanced
trees. The used balance criteria also allow us to maintain a balanced
tree without any balance information stored in the nodes.
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