Discrete Mathematics & Theoretical Computer Science (Dec 2002)

The height of q-Binary Search Trees

  • Michael Drmota,
  • Helmut Prodinger

Journal volume & issue
Vol. 5, no. 1

Abstract

Read online

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.