Numerical Studies of the Asymptotic Height Distribution in Binary Search Trees

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 obtai...

Full description

Bibliographic Details
Main Author: Charles Knessl
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2003-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
Online Access:https://dmtcs.episciences.org/319/pdf