On the concentration of the height of binary search trees

DOI10.1007/3-540-63165-8_200zbMath1401.68053OpenAlexW1540721942MaRDI QIDQ4571975

John Michael Robson

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_200

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (6)

Smoothed analysis of binary search trees ⋮ Retracted: Strong limiting behavior in binary search 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 ⋮ Constant bounds on the moments of the height of binary search trees

Cites Work

• A note on the height of binary search trees
• On the Generation of Random Binary Search Trees
• On the Variance of the Height of Random Binary Search Trees

This page was built for publication: On the concentration of the height of binary search trees