Accession Number : AD0715960

Title :   Optimum Binary Search Trees.

Descriptive Note : Technical summary rept.,

Corporate Author : WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER

Personal Author(s) : Hu,T. C. ; Tucker,A. C.

Report Date : MAR 1970

Pagination or Media Count : 51

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)

Descriptors :   (*CODING, OPTIMIZATION), SEARCH THEORY, TOPOLOGY, SEQUENCES(MATHEMATICS), ALGORITHMS, COMPUTER PROGRAMMING, PROBABILITY

Subject Categories : Cybernetics

Distribution Statement : APPROVED FOR PUBLIC RELEASE