An extended result of Kleitman and Saks concerning binary trees
Author:
- Chu Yung-ChingCYChu Yung-Ching
- 1 March 1985
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 10 (3) , 255-259
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Set Orderings Requiring Costliest Alphabetic Binary TreesSIAM Journal on Algebraic Discrete Methods, 1981
- Some results on Hu's conjecture concerning binary treesDiscrete Mathematics, 1980
- Optimal Computer Search Trees and Variable-Length Alphabetical CodesSIAM Journal on Applied Mathematics, 1971