This is an illustration of the optimal binary search tree example from the Cormen, Leiserson, Rivest and Stein book. The grid in the middle is the dynamic programming table being filled in, the values at the top are the keys, their probabilities and the probabilities for the gaps between the keys. Over at the right, we're showing the various subtrees the algorithm is considering.

свернуть