Mixed Poisson approximation of node depth distributions in random binary search trees

Simple item page
dc.creatorGrubel, Rudolf
dc.creatorStefanoski, Nikolce
dc.date2005-03-31
dc.date.accessioned2026-07-07T05:18:41Z
dc.date.available2026-07-07T05:18:41Z
dc.descriptionWe investigate the distribution of the depth of a node containing a specific key or, equivalently, the number of steps needed to retrieve an item stored in a randomly grown binary search tree. Using a representation in terms of mixed and compounded standard distributions, we derive approximations by Poisson and mixed Poisson distributions; these lead to asymptotic normality results. We are particularly interested in the influence of the key value on the distribution of the node depth. Methodologically our message is that the explicit representation may provide additional insight if compared to the standard approach that is based on the recursive structure of the trees. Further, in order to exhibit the influence of the key on the distributional asymptotics, a suitable choice of distance of probability distributions is important. Our results are also applicable in connection with the number of recursions needed in Hoare's [Comm. ACM 4 (1961) 321-322] selection algorithm Find.
dc.descriptionPublished at http://dx.doi.org/10.1214/105051604000000611 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
dc.identifierhttps://arxiv.org/abs/math/0503738
dc.identifierhttp://arxiv.org/abs/math/0503738
dc.identifierAnnals of Applied Probability 2005, Vol. 15, No. 1A, 279-297
dc.identifierdoi:10.1214/105051604000000611
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74746
dc.subjectProbability
dc.subject68Q25,, 68P10, 60F05 (Primary) . (Secondary)
dc.titleMixed Poisson approximation of node depth distributions in random binary search trees
dc.typetext

Files

Collections

arXiv