A Best Possible Bound for The Weighted Path Length of Binary Search Trees

DOI10.1137/0206017zbMATH0362.68072DBLPjournals/siamcomp/Mehlhorn77OpenAlexW2000568806WikidataQ126089532MaRDI QIDQ4136557FDOQ4136557

Authors K. Mehlhorn

Publication date 1977

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0206017

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(20)

• Restructuring binary search trees revisited
• Compressed depth sequences
• Dynamic Trees with Almost-Optimal Access Cost
• Compressing probability distributions
• Reflections on Optimal and Nearly Optimal Binary Search Trees
• Optimal binary search trees
• scientific article; zbMATH DE number 7378733 (Why is no real title available?)
• On binary search trees
• Tight bounds for online stable sorting
• Competitive Online Search Trees on Trees
• A new genetic approach to construct near-optimal binary search trees
• Lower bounds for expected-case planar point location
• Optimum multiway search trees
• Operations research applications of dichotomous search
• Greedy binary search trees are nearly optimal
• Efficient Construction of Near-Optimal Binary and Multiway Search Trees
• New lower bounds on the cost of binary search trees
• Binary search trees in secondary memory
• A history of distribution-sensitive data structures
• Assembling approximately optimal binary search trees efficiently using arithmetics

This page was built for publication: A Best Possible Bound for The Weighted Path Length of Binary Search Trees

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