A q-analogue of the path length of binary search trees

Simple item page
dc.creatorProdinger, Helmut
dc.date1999-10-14
dc.date.accessioned2026-07-07T05:31:09Z
dc.date.available2026-07-07T05:31:09Z
dc.descriptionA reformulation of the path length of binary search trees is given in terms of permutations, allowing to extend the definition to the instance of words, where the letters are obtained by independent geometric random variables (with parameter q). In this way, expressions for expectation and variance are obtained which in the limit for $q\to1$ are the classical expressions.
dc.identifierhttps://arxiv.org/abs/math/9910070
dc.identifierhttp://arxiv.org/abs/math/9910070
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/79238
dc.subjectCombinatorics
dc.subject05A15, 05A30, 68P10
dc.titleA q-analogue of the path length of binary search trees
dc.typetext

Files

Collections

arXiv