Characteristic inequalities for binary trees

DOI10.1016/0020-0190(94)00193-3zbMATH Open0875.68681OpenAlexW2312272731MaRDI QIDQ674183FDOQ674183

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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• The Complexity of Maintaining an Array and Computing Its Partial Sums
• Title not available (Why is that?)

Cited In (3)

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

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)