Skip to Main content Skip to Navigation
Journal articles

The height of q-Binary Search Trees

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/hal-00958975
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 4:55:29 PM
Last modification on : Wednesday, February 20, 2019 - 4:32:10 PM
Long-term archiving on: : Friday, June 13, 2014 - 12:07:02 PM

File

dm050106.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00958975, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

186

Files downloads

865