Least upper bound on the cost of optimum binary search trees

DOI10.1007/BF00289510zbMath0233.68011OpenAlexW2005247984MaRDI QIDQ2551315

Yanyan Li

Publication date: 1972

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

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

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (2)

Some results on Hu's conjecture concerning binary trees ⋮ Optimal binary search trees

Cites Work

• Optimum binary search trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Path Length of Binary Search Trees

This page was built for publication: Least upper bound on the cost of optimum binary search trees