A new proof of the Garsia-Wachs algorithm

DOI10.1016/0196-6774(88)90009-0zbMath0635.68067OpenAlexW2163890240MaRDI QIDQ3774966

Jeffrey H. Kingston

Publication date: 1988

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(88)90009-0

zbMATH Keywords

Garsia-Wachs algorithmminimum cost binary trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Search theory (90B40)

Related Items (4)

Operations research applications of dichotomous search ⋮ Correctness of constructing optimal alphabetic trees revisited ⋮ An optimal, purely functional implementation of the Garsia–Wachs algorithm ⋮ Optimal binary search trees

This page was built for publication: A new proof of the Garsia-Wachs algorithm