Upper Bounds for the Total Path Length of Binary Trees

DOI10.1145/321738.321739zbMath0263.68022OpenAlexW1982765710MaRDI QIDQ5679704

No author found.

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)

Related Items (10)

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

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