Optimal Binary Search Trees

Tobias Nipkow and Dániel Somogyi

27 May 2018


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

Depends On


Related Entries