๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Stratified balanced search trees

โœ Scribed by Jan Leeuwen; Mark H. Overmars


Publisher
Springer-Verlag
Year
1983
Tongue
English
Weight
731 KB
Volume
18
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


General Balanced Trees
โœ Arne Andersson ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 117 KB

We show that, in order to achieve efficient maintenance of a balanced binary search tree, no shape restriction other than a logarithmic height is required. The obtained class of trees, general balanced trees, may be maintained at a logarithmic amortized cost with no balance information stored in the