Optimal binary search trees

DOI10.1080/00207168608803511zbMath0655.68079OpenAlexW2072924299MaRDI QIDQ5903763

Wlodzimierz Dobosiewicz

Publication date: 1986

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168608803511

zbMATH Keywords

searchingbinary split treesoptimal search treesoptimal binary search treesbinary comparison cost

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Cites Work

• Unnamed Item
• Generalized binary split trees
• Optimum binary search trees
• Optimal binary split trees
• Binary search trees with binary comparison cost
• Bounds for optimalα-β binary trees
• Median split trees

This page was built for publication: Optimal binary search trees