Average number of rotations access cost in iR-trees

DOI10.1007/BF02136039zbMath0545.68053OpenAlexW2021469256MaRDI QIDQ797286

N. E. Zubov

Publication date: 1984

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

binary search treesaverage number of comparisonsaverage number of rotations/reorganizationsiR trees

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Unnamed Item
• Unnamed Item
• Binary search trees with limited rotation
• On random 2-3 trees
• Locally balanced binary trees

This page was built for publication: Average number of rotations access cost in iR-trees