Optimality of right leaning trees

DOI10.1007/3-540-19368-5_8MaRDI QIDQ3799944zbMATH OpenOpenAlexFDO

Authors Herman Akdag, Bernadette Bouchon

Publication date 1988

Published in Coding Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-19368-5_8

zbMATH Keywords

binary search treesHuffman algorithmL-optimalpath lengthprobabilities

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Management decision making, including multiple objectives (90B50) Theory of questionnaires (94A50)

Recommendations

• Path Length of Binary Search Trees
• Optimal binary search trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Extremal properties of ?-weighted binary trees
• Algorithms and Computation

Cited in

(1)

• LATIN 2004: Theoretical Informatics

This page was built for publication: Optimality of right leaning trees

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