Numerical studies of the expected height in randomly built binary search trees

MaRDI QIDQ5453622zbMATH OpenFDO

Authors Dirk Wagner, J. M. Dye

Publication date 3 April 2008

zbMATH Keywords

recurrence relationcombinatorial proof

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• An analytic approach to the height of binary search trees
• On the Variance of the Height of Random Binary Search Trees
• A note on the height of binary search trees
• On the Generation of Random Binary Search Trees
• The height of a random binary search tree

Cited in

(7)

• On the Variance of the Height of Random Binary Search Trees
• How tall is a tree?
• An analytic approach to the height of binary search trees
• On a random search tree: asymptotic enumeration of vertices by distance from leaves
• The height of a random binary search tree
• On the concentration of the height of binary search trees
• On Finding the Height of a Binary Search Tree

This page was built for publication: Numerical studies of the expected height in randomly built binary search trees

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