Optimal binary split trees

DOI10.1016/0196-6774(84)90041-5zbMath0536.68060OpenAlexW2039536624MaRDI QIDQ3321483

No author found.

Publication date: 1984

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(84)90041-5

zbMATH Keywords

algorithmoptimal representations of split treessuboptimal split trees

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (9)

Optimal search trees using two-way key comparisons ⋮ Ordered priority queues ⋮ Optimal multiway generalized split trees ⋮ Classification via two-way comparisons (extended abstract) ⋮ Optimal binary search trees ⋮ On the cost of unsuccessful searches in search trees with two-way comparisons ⋮ On Huang and Wong's algorithm for generalized binary split trees ⋮ Generalized binary split trees ⋮ A note on optimal multiway split trees

This page was built for publication: Optimal binary split trees