(3) The John Knopfmacher Centre for Applicable Analysis and Number Theory [Johannesburg]
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.
