Minimal path length of trees with known fringe

DOI10.1016/0304-3975(95)80019-0zbMath0873.68151OpenAlexW2106055224MaRDI QIDQ673649

Giuseppe Parlati, Giuseppe Persiano, Roberto De Prisco

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)80019-0

zbMATH Keywords

minimal treetime algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) General topics in the theory of algorithms (68W01)

Related Items

A note on the expected path length of trees with known fringe, Optimal binary search trees, Fringe thickness and maximum path length of binary trees

Cites Work

• A tight upper bound for the path length of AVL trees
• Maximal path length of binary trees
• On the path length of binary trees
• Tight Upper and Lower Bounds on the Path Length of Binary Trees
• Upper Bounds for the Total Path Length of Binary Trees
• Unnamed Item
• Unnamed Item