Maximal path length of binary trees

DOI10.1016/0166-218X(94)90034-5zbMath0821.68094WikidataQ127061339 ScholiaQ127061339MaRDI QIDQ1337670

Derick Wood, Helen Cameron

Publication date: 19 September 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

path length of binary trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

A note on the expected path length of trees with known fringe ⋮ Binary trees, fringe thickness and minimum path length ⋮ Minimal path length of trees with known fringe ⋮ Extremal values of the Sackin tree balance index ⋮ Fringe thickness and maximum path length of binary trees ⋮ Pm numbers, ambiguity, and regularity

Cites Work

• Pm numbers, ambiguity, and regularity
• On the path length of binary trees
• Upper Bounds for the Total Path Length of Binary Trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximal path length of binary trees