Binary search trees of almost optimal height

DOI10.1007/BF01237235zbMath0696.68029OpenAlexW1971131533MaRDI QIDQ911247

N. E. Zubov

Publication date: 1990

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

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

zbMATH Keywords

complexityupper boundbinary search treesdictionary problem

Mathematics Subject Classification ID

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

Related Items (3)

Binary search trees: How low can you go? ⋮ Balanced search trees made simple ⋮ Optimal binary search trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The design of dynamic data structures
• On the relationship between son-trees and symmetric binary B-trees
• Stratified balanced search trees
• Implementing dictionaries using binary trees of very small height
• Updating a balanced search tree in 0(1) rotations
• Organization and maintenance of large ordered indexes
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Priority Search Trees
• UPDATING BINARY TREES WITH CONSTANT LINKAGE COST
• Optimizing binary trees grown with a sorting algorithm
• Binary Search Trees of Bounded Balance

This page was built for publication: Binary search trees of almost optimal height