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

On balanced versus unbalanced computation trees

โœ Scribed by U. Hertrampf, H. Vollmer, K. W. Wagner


Book ID
112495643
Publisher
Springer
Year
1996
Tongue
English
Weight
621 KB
Volume
29
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Balanced versus unbalanced growth
โœ Wilfred A. Ndongko ๐Ÿ“‚ Article ๐Ÿ“… 1975 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 375 KB
Balance on unbalanced growth
โœ David F. Bradford ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Springer Vienna ๐ŸŒ English โš– 1013 KB
On rotations in fringe-balanced binary t
โœ Hosam M. Mahmoud ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 451 KB

We employ a P6lya urn to model rotations in a random fringe-balanced binary search tree. We show that asymptotically the number of rotations to construct a tree of size n has a normal distribution with mean +n and variance sn. Exact results for mean and variance are developed in the process. @ 1998