On the costs of optimal and near-optimal binary search trees

DOI10.1007/BF00263193zbMath0493.68062OpenAlexW2064550471MaRDI QIDQ1168742

Brian M. Allen

Publication date: 1982

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00263193

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (4)

Operations research applications of dichotomous search ⋮ Dynamic Trees with Almost-Optimal Access Cost ⋮ Optimal binary search trees ⋮ Reflections on Optimal and Nearly Optimal Binary Search Trees

This page was built for publication: On the costs of optimal and near-optimal binary search trees