A note on the expected path length of trees with known fringe

DOI10.1016/0020-0190(96)00129-9zbMath0875.68705OpenAlexW2026003143MaRDI QIDQ1350914

Roberto De Prisco, Giuseppe Persiano, Giuseppe Parlati

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00129-9

zbMATH Keywords

Binary treesAlgorithms and data structuresPath length

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items

Binary trees, fringe thickness and minimum path length

Cites Work

• Unnamed Item
• Minimal path length of trees with known fringe
• A tight upper bound for the path length of AVL trees
• A note on the path length of red-black 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