# Optimal Binary Search Tree

Given a sorted list of search items `A[1...n]` and a frequency list `f[1...n]`, where `f[i]` is the number of times we will search for element `A[i]`.