(Un)expected path lengths of asymmetric binary search trees

DOI10.1007/3-540-56610-4_99MaRDI QIDQ5044774zbMATH OpenOpenAlexFDO

Authors Uwe Trier

Publication date 2 November 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-56610-4_99

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An analytic approach to the height of binary search trees
• Smoothed analysis of binary search trees
• scientific article; zbMATH DE number 3858431
• Expected Costs in Some Classes of Binary Search Trees
• Binary search trees constructed from nondistinct keys with/without specified probabilities

Cites work

• Analysis of the space of search trees under the random insertion algorithm
• scientific article; zbMATH DE number 4027492 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3565290 (Why is no real title available?)
• scientific article; zbMATH DE number 3216527 (Why is no real title available?)
• On the Altitude of Nodes in Random Trees
• The expected additive weight of trees

Cited in

(4)

• Tree asymmetry -- a sensitive and practical measure for binary topological trees
• Binary search trees constructed from nondistinct keys with/without specified probabilities
• A q-analogue of the path length of binary search trees
• Path length and height in asymmetric binary branching trees

This page was built for publication: (Un)expected path lengths of asymmetric binary search trees

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