Characteristic inequalities for binary trees

DOI10.1016/0020-0190(94)00193-3zbMath0875.68681OpenAlexW2312272731MaRDI QIDQ674183

Giuseppe Persiano, Roberto De Prisco

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)

Related Items (1)

Optimal binary search trees

Cites Work

• Unnamed Item
• Unnamed Item
• The Complexity of Maintaining an Array and Computing Its Partial Sums

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