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.
Zapisane w:
| Główni autorzy: | , |
|---|---|
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
Discrete Mathematics & Theoretical Computer Science
2002-01-01
|
| Seria: | Discrete Mathematics & Theoretical Computer Science |
| Hasła przedmiotowe: | |
| Dostęp online: | https://dmtcs.episciences.org/304/pdf |
| Etykiety: |
Nie ma etykietki, Dołącz pierwszą etykiete!
|