I found this quite interesting. Basically, given the following description: Binary search solves the problem [of searching within a pre-sorted array] by keeping track of a range within the array in ...

An algorithm is given for constructing an alphabetic binary tree of minimum weighted path length (for short, an optimal alphabetic tree). The algorithm needs 4n 2 + 2n operations and 4n storage ...