Amortized constant relaxed rebalancing using standard rotations

DOI10.1007/s002360050145zbMath0910.68057OpenAlexW2082993995MaRDI QIDQ1127819

Kim S. Larsen

Publication date: 29 March 1999

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

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

zbMATH Keywords

search treesamortized constant rebalancing

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Red-black trees with constant update time ⋮ Relaxed multi-way trees with group updates. ⋮ AVL trees with relaxed balance ⋮ VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE