Optimum alphabetic binary trees
We describe a modification of the Hu-Tucker algorithm for constructing an optimal alphabetic tree that runs in O(n) time for several classes of inputs. These classes can be described in simple terms and can be detected in linear time. We also give simple conditions and a linear algorithm for determining, in some cases, if two adjacent nodes will be combined in the optimal alphabetic tree.
Unable to display preview. Download preview PDF.
- 1.Arne Andersson. A note on searching in a binary search tree. Software-Practice and Experience, 21(10):1125–1128, 1991.Google Scholar
- 3.E. N. Gilbert and E. F. Moore. Variable length binary encodings. Bell System Technical Journal, 38:933–968, 1959.Google Scholar
- 4.T. C. Hu. Combinatorial Algorithms. Addison-Wesley, Reading, MA, 1982.Google Scholar
- 7.D. A. Huffman. A method for the construction of minimum redundancy codes. Proceedings of the IRE, 40:1098–1101, 1952.Google Scholar
- 8.M. M. Klawe and B. Mumey. Upper and lower bounds on constructing alphabetic binary trees. In Proceedings of Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 185–193, 1993.Google Scholar
- 10.D. E. Knuth. The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.Google Scholar
- 13.N. Nakatsu. An alphabetic code and its application to information retrieval. Transactions of the Information Processing Society of Japan, 34(2):312–19, 1993.Google Scholar
- 14.T.M. Przytycka and L.L. Larmore. The optimal alphabetic tree problem revisited. In Proceedings of 21st International Colloquium on Automata, Languages, and Programming, pages 251–262. Springer-Verlag, July 1994.Google Scholar