Binary search trees: How low can you go?

DOI10.1007/3-540-61422-2_151zbMath1502.68097OpenAlexW1514315450MaRDI QIDQ5054833

Rolf Fagerberg

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_151

Mathematics Subject Classification ID

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

Related Items (1)

Dynamic Trees with Almost-Optimal Access Cost

Cites Work

• Unnamed Item
• Unnamed Item
• The design of dynamic data structures
• Binary search trees of almost optimal height
• A balanced search tree O(1) worst-case update time
• Implementing dictionaries using binary trees of very small height
• A constant update time finger search tree
• Fast updating of well-balanced trees
• Lower bounds for monotonic list labeling
• A tight lower bound for on-line monotonic list labeling

This page was built for publication: Binary search trees: How low can you go?