> Merkliste Sie können Bookmarks mittels Listen verwalten, loggen Sie sich dafür bitte in Ihr SLUB Benutzerkonto ein.
Medientyp: Sonstige Veröffentlichung; E-Artikel Titel: On the subtree size profile of binary search trees Beteiligte: Dennert, Florian [VerfasserIn]; Grübel, Rudolf [VerfasserIn] Erschienen: Cambridge : Cambridge University Press, 2010 Erschienen in: Combinatorics, Probability and Computing 19 (2010), Nr. 4 Ausgabe: published Version Sprache: Englisch DOI: https://doi.org/10.15488/2695; https://doi.org/10.1017/S0963548309990630 ISSN: 0963-5483 Schlagwörter: Qualitative differences ; Process view ; Binary search trees ; Binary trees ; Upper-end ; Joint distributions ; Asymptotic behaviour ; Random tree ; Trees (mathematics) ; Asymptotic analysis ; K-values ; Binary search tree algorithms ; Subtrees Entstehung: Anmerkungen: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen. Beschreibung: For random trees T generated by the binary search tree algorithm from uniformly distributed input we consider the subtree size profile, which maps k ∈ ℕ to the number of nodes in T that root a subtree of size k. Complementing earlier work by Devroye, by Feng, Mahmoud and Panholzer, and by Fuchs, we obtain results for the range of small k-values and the range of k-values proportional to the size n of T. In both cases emphasis is on the process view, i.e., the joint distributions for several k-values. We also show that the dynamics of the tree sequence lead to a qualitative difference between the asymptotic behaviour of the lower and the upper end of the profile. Copyright © 2010 Cambridge University Press. Zugangsstatus: Freier Zugang