Sciweavers

Share
ESA
2005
Springer

Optimal Integer Alphabetic Trees in Linear Time

9 years 9 months ago
Optimal Integer Alphabetic Trees in Linear Time
Abstract. 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.
T. C. Hu, Lawrence L. Larmore, J. David Morgenthal
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where ESA
Authors T. C. Hu, Lawrence L. Larmore, J. David Morgenthaler
Comments (0)
books