An analytic approach to the height of binary search trees

zbMath0971.68040MaRDI QIDQ1840504

Michael Drmota

Publication date: 11 February 2001

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

binary search trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (8)

Smoothed analysis of binary search trees ⋮ Retracted: Strong limiting behavior in binary search trees ⋮ The height of increasing trees ⋮ Limiting theorems for the nodes in binary search trees ⋮ On Robson's convergence and boundedness conjectures concerning the height of binary search trees ⋮ The variance of the height of binary search trees ⋮ The height of a binary search tree: the limiting distribution perspective. ⋮ Extreme value statistics and traveling fronts: Various applications

This page was built for publication: An analytic approach to the height of binary search trees