Generalized binary split trees

DOI10.1007/BF00289143zbMath0541.68038OpenAlexW2077383771MaRDI QIDQ794439

N. E. Zubov

Publication date: 1984

Published in: Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

polynomial time algorithmbinary treesdata structurebinary split treesgeneralized split treesoptimal tree structures

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (7)

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

Cites Work

• Unnamed Item
• Nearly optimal binary search trees
• Optimum binary search trees
• Optimal binary split trees
• The construction of optimal multiway search trees and the monotonicity principle
• Median split trees

This page was built for publication: Generalized binary split trees