scientific article; zbMATH DE number 1741002

zbMATH Open0994.68053MaRDI QIDQ4331192FDOQ4331192

Authors: Michael Drmota, Helmut Prodinger 

Publication date: 26 September 2002

Full work available at URL: https://eudml.org/doc/122062

Title of this publication is not available (Why is that?)

Recommendations

• A \(q\)-analogue of the path length of binary search trees
• scientific article; zbMATH DE number 852055
• The height of a binary search tree: the limiting distribution perspective.
• An analytic approach to the height of binary search trees
• A note on the height of binary search trees

zbMATH Keywords

height\(q\)-analoguebinary search tree

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cited In (4)

• A \(q\)-analogue of the path length of binary search trees
• Binary search trees of almost optimal height
• Onq-trees
• A note on the height of binary search trees

This page was built for publication:

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