The height of q-Binary Search Trees
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.
Gardado en:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Discrete Mathematics & Theoretical Computer Science
2002-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Assuntos: | |
| Acceso en liña: | https://dmtcs.episciences.org/304/pdf |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|