Upper Bounds for the Total Path Length of Binary Trees

DOI10.1145/321738.321739MaRDI QIDQ5679704zbMATH OpenOpenAlexFDO

Authors

Publication date 1973

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321738.321739

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited in

(11)

• Binary search trees in secondary memory
• Fringe thickness and maximum path length of binary trees
• Maximal path length of binary trees
• A note on the expected path length of trees with known fringe
• Extremal values of the Sackin tree balance index
• Bounds on the weighted path length of binary trees
• Bounds for optimalα-β binary trees
• Binary trees, fringe thickness and minimum path length
• Optimal binary search trees
• Minimal path length of trees with known fringe
• Grandchildren-weight-balanced binary search trees

This page was built for publication: Upper Bounds for the Total Path Length of Binary Trees

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