  We give a new algorithm to construct optimal alphabetic ternary trees, where
every internal node has at most three children. This algorithm generalizes the
classic Hu-Tucker algorithm, though the overall computational complexity has
yet to be determined.
