Michael Drmota, Helmut Prodinger. The height of q-Binary Search Trees. Discrete Mathematics & Theoretical Computer Science, 5(1):97-108, 2002. [doi]
@article{DrmotaP02:0,
title = {The height of q-Binary Search Trees},
author = {Michael Drmota and Helmut Prodinger},
year = {2002},
url = {http://dmtcs.loria.fr/volumes/abstracts/dm050106.abs.html},
tags = {search},
researchr = {https://researchr.org/publication/DrmotaP02%3A0},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics & Theoretical Computer Science},
volume = {5},
number = {1},
pages = {97-108},
}