Upper Bound on the cost of Optimum Binary Search Trees.
Technical summary rept.,
WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER
Pagination or Media Count:
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
- Theoretical Mathematics