Bounds on the weighted path length of binary trees

DOI10.1016/0020-0190(72)90015-4zbMath0256.68008OpenAlexW2051610048MaRDI QIDQ2559138

Yanyan Li

Publication date: 1972

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

Full work available at URL: https://doi.org/10.1016/0020-0190(72)90015-4

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cites Work

• Optimum binary search trees
• A Method for the Construction of Minimum-Redundancy Codes
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Upper Bounds for the Total Path Length of Binary Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on the weighted path length of binary trees