Universal Limit Laws for Depths in Random Trees

Universal Limit Laws for Depths in Random Trees

Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these trees, we offer a universal law of large numbers and a limit law for the depth of the last inserted point, as well as a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on computing 1998-01, Vol.28 (2), p.409-432
1. Verfasser: Devroye, Luc
Format: Artikel
Sprache:eng
Schlagworte:
Children & youth
Probability
Random variables
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these trees, we offer a universal law of large numbers and a limit law for the depth of the last inserted point, as well as a law of large numbers for the height.
ISSN:0097-5397
1095-7111
DOI:10.1137/S0097539795283954