Summary: PREPRINT. International Journal of Computer Matehmathics, 38:3748, 1990.
Maintaining ffbalanced Trees by Partial Rebuilding
Arne Andersson \Lambda
Department of Computer Science
S221 00 Lund
The balance criterion defining the class of ffbalanced trees states that
the ratio between the shortest and longest paths from a node to a
leaf be at least ff. We show that a straightforward use of partial
rebuilding for maintenance of ffbalanced trees requires an amortized
cost of \Omega\Gamma p
n) per update. By slight modifications of the maintenance
algorithms the cost can be reduced to O(log n) for any value of ff,
0 ! ff ! 1.
KEY WORDS ffbalanced trees, partial rebuilding, search trees.
CR CATEGORIES: E.1, F.2, I.1.2.