Upper Bound on the cost of Optimum Binary Search Trees.

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)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1972
Accession Number
AD0744326

Entities

People

  • K. C. Tan
  • T. C. Hu

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Trees (Data Structures)

Fields of Study

  • Computer science

Readers

  • Computer Programming and Software Development.
  • Operations Research