Optimum Binary Search Trees.

Abstract

An algorithm is given for constructing optimum variable-length alphabetic binary code. The algorithm needs O(n squared) operations and 4n storage locations, where n is the number of letters in the alphabet. The same algorithm can be used for constructing optimum binary search trees. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1970
Accession Number
AD0715960

Entities

People

  • A. C. Tucker
  • T. C. Hu

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Alphabets
  • Digital Information
  • Trees (Data Structures)

Readers

  • Computational Linguistics
  • Linear Algebra
  • Radio communications and signal processing.