Abstract : q-binary search trees are obtained from words, equipped with a geometric distribution instead of permutations. The average and variance of the heighth computated, based on random words of length n, as well as a Gaussian limit law.
https://hal.inria.fr/hal-00958975
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Soumis le : jeudi 13 mars 2014 - 16:55:29
Dernière modification le : mercredi 20 février 2019 - 16:32:10
Document(s) archivé(s) le : vendredi 13 juin 2014 - 12:07:02
Michael Drmota, Helmut Prodinger. The height of q-Binary Search Trees. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2002, 5, pp.97-108. 〈hal-00958975〉
