optimal binary search tree Algorithm

In computer science, an optimal binary search tree (Optimal BST), sometimes named a weight-balanced binary tree, is a binary search tree which provides the smallest possible search time (or expected search time) for a given sequence of accesses (or access probabilities).Various algorithms exist to construct or estimate the statically optimal tree given the information on the access probabilities of the components.

optimal binary search tree source code, pseudocode and analysis