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→∞) 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.

Source : oai:HAL:hal-00958992v1

Volume: Vol. 6 no. 1

Published on: January 1, 2003

Submitted on: March 26, 2015

Keywords: asymptotics,height,binary search trees,numerical analysis,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

This page has been seen 112 times.

This article's PDF has been downloaded 44 times.