Constant bounds on the moments of the height of binary search trees

DOI10.1016/S0304-3975(01)00306-1zbMath1002.68036MaRDI QIDQ1605322

John Michael Robson

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

heightbinary search treequicksort

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (7)

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 ⋮ The properties of random trees ⋮ Recent results and questions in combinatorial game complexities

Cites Work

• A note on the height of binary search trees
• On the concentration of 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: Constant bounds on the moments of the height of binary search trees