Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Limit laws for local counters in random binary search trees
Ist Teil von
Random structures & algorithms, 1991-09, Vol.2 (3), p.303-315
Ort / Verlag
New York: Wiley Subscription Services, Inc., A Wiley Company
Erscheinungsjahr
1991
Link zum Volltext
Quelle
Wiley Online Library Journals Frontfile Complete
Beschreibungen/Notizen
Limit laws for several quantities in random binary search trees that are related to the local shape of a tree around each node can be obtained very simply by applying central limit theorems for w‐dependent random variables. Examples include: the number of leaves (Ln), the number of nodes with k descendants (k fixed), the number of nodes with no left child, the number of nodes with k left descendants. Some of these results can also be obtained via the theory of urn models, but the present method seems easier to apply.