An extended result of Kleitman and Saks concerning binary trees

DOI10.1016/0166-218X(85)90047-2zbMath0567.68039MaRDI QIDQ1060017

Yung-ching Chu

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

alphabetic binary treesHuang's conjecture

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Operations research applications of dichotomous search

Cites Work

• Some results on Hu's conjecture concerning binary trees
• Set Orderings Requiring Costliest Alphabetic Binary Trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes

This page was built for publication: An extended result of Kleitman and Saks concerning binary trees