A New Proof of the T-C Algorithm.

Abstract

An algorithm for constructing an alphabetic binary tree of minimum weighted path length was suggested by Hu and Tucker. The algorithm called the T-C algorithm needs O(n log n) operations and O(n) storage locations, where n is the number of terminal nodes in the tree. Although the algorithm is simple to state, the associated proof was extremely complicated and long. Here a more revealing and comparatively shorter proof is given. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1972
Accession Number
AD0748762

Entities

People

  • T. C. Hu

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Terminals
  • Trees (Data Structures)

Fields of Study

  • Computer science

Readers

  • Forest Ecology
  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design