The height of q-Binary Search Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2002

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.
Fichier principal
Vignette du fichier
dm050106.pdf (76.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00958975 , version 1 (13-03-2014)

Identifiers

Cite

Michael Drmota, Helmut Prodinger. The height of q-Binary Search Trees. Discrete Mathematics and Theoretical Computer Science, 2002, Vol. 5, pp.97-108. ⟨10.46298/dmtcs.304⟩. ⟨hal-00958975⟩

Collections

TDS-MACS
74 View
641 Download

Altmetric

Share

Gmail Facebook X LinkedIn More