Spanning tree size in Random Binary Search Trees

Simple item page
dc.creatorPanholzer, Alois
dc.creatorProdinger, Helmut
dc.date2004-05-14
dc.date.accessioned2026-07-07T05:08:17Z
dc.date.available2026-07-07T05:08:17Z
dc.descriptionThis paper deals with the size of the spanning tree of p randomly chosen nodes in a binary search tree. It is shown via generating functions methods, that for fixed p, the (normalized) spanning tree size converges in law to the Normal distribution. The special case p=2 reproves the recent result (obtained by the contraction method by Mahmoud and Neininger [Ann. Appl. Probab. 13 (2003) 253-276]), that the distribution of distances in random binary search trees has a Gaussian limit law. In the proof we use the fact that the spanning tree size is closely related to the number of passes in Multiple Quickselect. This parameter, in particular, its first two moments, was studied earlier by Panholzer and Prodinger [Random Structures Algorithms 13 (1998) 189-209]. Here we show also that this normalized parameter has for fixed p-order statistics a Gaussian limit law. For p=1 this gives the well-known result that the depth of a randomly selected node in a random binary search tree converges in law to the Normal distribution.
dc.identifierhttps://arxiv.org/abs/math/0405292
dc.identifierhttp://arxiv.org/abs/math/0405292
dc.identifierAnnals of Applied Probability 2004, Vol. 14, No. 2, 718-733
dc.identifierdoi:10.1214/105051604000000071
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71201
dc.subjectProbability
dc.subject05C05, 60C05 (Primary) 60F05, 68P05 (Secondary)
dc.titleSpanning tree size in Random Binary Search Trees
dc.typetext

Files

Collections

arXiv