Characteristic inequalities for binary trees

DOI10.1016/0020-0190(94)00193-3MaRDI QIDQ674183zbMATH OpenOpenAlexFDO

Authors Roberto De Prisco, Giuseppe Persiano

Publication date 28 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(94)00193-3

zbMATH Keywords

Data structuresBinary treesKraft-McMillan's inequalityPartial sums problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Recommendations

• On the path length of binary trees
• scientific article; zbMATH DE number 4173001
• Extremal properties of ?-weighted binary trees
• scientific article; zbMATH DE number 5279360
• Binary trees with choosable edge lengths

Cites work

• scientific article; zbMATH DE number 4210044 (Why is no real title available?)
• scientific article; zbMATH DE number 3316587 (Why is no real title available?)
• The Complexity of Maintaining an Array and Computing Its Partial Sums

Cited in

(3)

• Optimal binary search trees
• Enumerative sequences of leaves in rational trees
• A Ratio Inequality for Binary Trees and the Best Secretary

This page was built for publication: Characteristic inequalities for binary trees

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