# Discrete Mathematics & Theoretical Computer Science

## Volume 5 n° 1 (2002), pp. 97-108

author: | Michael Drmota and Helmut Prodinger |
---|---|

title: | The height of q-Binary Search Trees |

keywords: | binary search tree, q-analogue, height |

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.
If your browser does not display the abstract correctly (because of the different mathematical symbols) you can look it up in the PostScript or PDF files. |

reference: | Michael Drmota and Helmut Prodinger (2002),
The height of q-Binary Search Trees,
Discrete Mathematics and Theoretical Computer Science 5, pp. 97-108 |

bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |

ps.gz-source: | dm050106.ps.gz (33 K) |

ps-source: | dm050106.ps (108 K) |

pdf-source: | dm050106.pdf (114 K) |

The first *source* gives you the `gzipped' PostScript, the second the plain
PostScript and the third the format for the Adobe accrobat
reader. Depending on the installation of your web browser, at least
one of these should (after some amount of time) pop up a window for
you that shows the full article. If this is not the case, you should
contact your system administrator to install your browser correctly.

Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.

Automatically produced on Mon Apr 29 22:22:30 CEST 2002 by ifalk