An extended result of Kleitman and Saks concerning binary trees

DOI10.1016/0166-218X(85)90047-2zbMATH Open0567.68039MaRDI QIDQ1060017FDOQ1060017

Yongjin Zhu

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)

Cites Work

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

Cited In (5)

• Leighton's theorem : extensions, limitations and quasitrees
• Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees
• Weakly binary expansions of dense meet‐trees
• Operations research applications of dichotomous search
• Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A version of the Loebl-Komlós-Sós conjecture for skew trees 👍 👎
• A Borg–Levinson theorem for trees 👍 👎
• A tree version of Kőnig's theorem 👍 👎
• An almost sure result for path lengths in binary search trees 👍 👎
• The extended Cantor-Bendixson analysis of trees 👍 👎
• An extension to trees of the Sardinas and Patterson algorithm 👍 👎
• The Cantor-Bendixson Analysis of Finite Trees 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060017)