Bounds for optimalα-β binary trees

DOI10.1007/BF01932395zbMath0361.05031OpenAlexW2335281023MaRDI QIDQ4133999

No author found.

Publication date: 1977

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01932395

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Algorithms in computer science (68W99)

Related Items (5)

Operations research applications of dichotomous search ⋮ Binary search trees with binary comparison cost ⋮ Optimal binary search trees ⋮ Optimal \(\alpha -\beta\)-strees with capacity constraint ⋮ Optimal \(\alpha -\beta\) trees with capacity constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper Bounds for the Total Path Length of Binary Trees

This page was built for publication: Bounds for optimalα-β binary trees