Accession Number : AD0744326

Title :   Upper Bound on the cost of Optimum Binary Search Trees.

Descriptive Note : Technical summary rept.,

Corporate Author : WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER

Personal Author(s) : Hu,T. C. ; Tan,K. C.

Report Date : MAR 1972

Pagination or Media Count : 10

Abstract : The paper gives the least upper bound on the weighted path length of an optimum lexiographic (alphabetic) binary search tree as a function of n, given the total weight of the n terminal nodes and n-1 internal nodes to be one. (Author)

Descriptors :   (*BINARY ARITHMETIC, SEARCH THEORY), SEQUENCES(MATHEMATICS), THEOREMS

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE