A Best Possible Bound for The Weighted Path Length of Binary Search Trees
From MaRDI portal
Publication:4136557
DOI10.1137/0206017zbMath0362.68072DBLPjournals/siamcomp/Mehlhorn77OpenAlexW2000568806WikidataQ126089532 ScholiaQ126089532MaRDI QIDQ4136557
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
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (20)
On binary search trees ⋮ New lower bounds on the cost of binary search trees ⋮ Efficient Construction of Near-Optimal Binary and Multiway Search Trees ⋮ A new genetic approach to construct near-optimal binary search trees ⋮ Operations research applications of dichotomous search ⋮ Optimum multiway search trees ⋮ Binary search trees in secondary memory ⋮ Unnamed Item ⋮ Greedy binary search trees are nearly optimal ⋮ Lower bounds for expected-case planar point location ⋮ Dynamic Trees with Almost-Optimal Access Cost ⋮ Tight bounds for online stable sorting ⋮ Optimal binary search trees ⋮ Assembling approximately optimal binary search trees efficiently using arithmetics ⋮ Compressed depth sequences ⋮ Reflections on Optimal and Nearly Optimal Binary Search Trees ⋮ Restructuring binary search trees revisited ⋮ Compressing probability distributions ⋮ A History of Distribution-Sensitive Data Structures ⋮ Competitive Online Search Trees on Trees
This page was built for publication: A Best Possible Bound for The Weighted Path Length of Binary Search Trees
