The variance of the height of binary search trees

DOI10.1016/S0304-3975(01)00006-8MaRDI QIDQ5958339zbMATH OpenWikidataFDO

Authors Michael Drmota

Publication date 3 March 2002

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

Full work available at URL https://doi.org/10.1016/S0304-3975(01)00006-8

zbMATH Keywords

average case analysisbinary search treegenerating functions

Mathematics Subject Classification ID

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

Cites work

• A note on the height of binary search trees
• An analytic approach to the height of binary search trees
• Branching processes in the analysis of the heights of trees
• Constant bounds on the moments of the height of binary search trees
• scientific article; zbMATH DE number 53861 (Why is no real title available?)
• On growing random binary trees
• On the concentration of the height of binary search trees
• On the Variance of the Height of Random Binary Search Trees
• The height of a random binary search tree

Cited in

(9)

• One-sided variations on binary search trees
• Limiting theorems for the nodes in binary search trees
• EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES
• Asymptotic variance of random symmetric digital search trees
• Retracted: Strong limiting behavior in binary search trees
• The Variance of Two Game Tree Algorithms
• On the Variance of the Height of Random Binary Search Trees
• On Robson's convergence and boundedness conjectures concerning the height of binary search trees
• Heights of butterfly trees

This page was built for publication: The variance of the height of binary search trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958339)