Optimal Binary Search Trees

Tobias Nipkow ­čîÉ and D├íniel Somogyi

May 27, 2018

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


This article formalizes recursive algorithms for the construction of optimal binary search trees given fixed access frequencies. We follow Knuth (1971), Yao (1980) and Mehlhorn (1984). The algorithms are memoized with the help of the AFP article Monadification, Memoization and Dynamic Programming, thus yielding dynamic programming algorithms.


BSD License


Related publications

Session Optimal_BST