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 ...

Consider a binary tree, to the vertices of which are assigned independent Bernoulli random variables with mean p ≤ 1/2. How many of these Bernoullis one must look at in order to find a path of length ...