# zbMATH — the first resource for mathematics

Numerical studies of the asymptotic height distribution in binary search trees. (English) Zbl 1035.68041
Summary: We study numerically a non-linear integral equation that arises in the study of binary search trees. If the tree is constructed from n elements, this integral equation describes the asymptotic (as $$n\to\infty$$) distribution of the height of the tree. This supplements some asymptotic results we recently obtained for the tails of the distribution. The asymptotic height distribution is shown to be unimodal with highly asymmetric tails.
##### MSC:
 68P10 Searching and sorting 68R10 Graph theory (including graph drawing) in computer science
##### Keywords:
asymptotics; height; binary search trees; numerical analysis
Full Text: