Binary Search Trees of Bounded Balance
- 1 March 1973
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 2 (1) , 33-43
- https://doi.org/10.1137/0202005
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Upper Bounds for the Total Path Length of Binary TreesJournal of the ACM, 1973
- A TOP-DOWN ALGORITHM FOR CONSTRUCTING NEARLY OPTIMAL LEXICOGRAPHIC TREES††This research was supported in part by the National Research Council of Canada.Published by Elsevier ,1972
- Optimal Computer Search Trees and Variable-Length Alphabetical CodesSIAM Journal on Applied Mathematics, 1971
- Optimum binary search treesActa Informatica, 1971
- Some Combinatorial Properties of Certain Trees With Applications to Searching and SortingJournal of the ACM, 1962