Faster construction of optimal binary split trees

DOI10.1016/0196-6774(86)90031-3zbMath0637.68070OpenAlexW2093708041MaRDI QIDQ3777468

No author found.

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0196-6774(86)90031-3

zbMATH Keywords

dynamic programmingsearchbinary searchheapsbinary split tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (8)

Optimal search trees using two-way key comparisons ⋮ Ordered priority queues ⋮ Optimal multiway generalized split trees ⋮ Classification via two-way comparisons (extended abstract) ⋮ On the construction of weighted time-optimal B-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 ⋮ A note on optimal multiway split trees

This page was built for publication: Faster construction of optimal binary split trees