The height of $q$-binary search trees.

@article{Drmota2002,
author = {Drmota, Michael, Prodinger, Helmut},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {binary search tree; -analogue; height; -analogue},
language = {eng},
number = {1},
pages = {97-108},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {The height of -binary search trees.},
url = {http://eudml.org/doc/122062},
volume = {5},
year = {2002},
}

TY - JOUR
AU - Drmota, Michael
AU - Prodinger, Helmut
TI - The height of -binary search trees.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2002
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 5
IS - 1
SP - 97
EP - 108
LA - eng
KW - binary search tree; -analogue; height; -analogue
UR - http://eudml.org/doc/122062
ER -