Maintaining α-balanced trees by partial rebuilding

DOI10.1080/00207169108803956zbMath0723.68032OpenAlexW2035806042MaRDI QIDQ3210890

No author found.

Publication date: 1991

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169108803956

zbMATH Keywords

search trees\(\alpha \) -balanced treespartial rebuilding

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On the relationship between son-trees and symmetric binary B-trees
• Dynamic multi-dimensional data structures based on quad- and k-d trees
• UPDATING BINARY TREES WITH CONSTANT LINKAGE COST
• Multidimensional binary search trees used for associative searching
• Binary Search Trees of Bounded Balance

This page was built for publication: Maintaining α-balanced trees by partial rebuilding