We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear time. We describe a hybrid algorithm that combines the bottom-up approach of the original Hu-Tucker algorithm with the top-down approach of Larmore and Przytycka's Cartesian tree algorithms. The hybrid algorithm demonstrates the computational equivalence of sorting and level tree construction. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Hu, T. C., Larmore, L. L., & Morgenthaler, J. D. (2005). Optimal integer alphabetic trees in linear time. In Lecture Notes in Computer Science (Vol. 3669, pp. 226–237). Springer Verlag. https://doi.org/10.1007/11561071_22
Mendeley helps you to discover research relevant for your work.