Average number of rotations access cost in iR-trees

DOI10.1007/BF02136039zbMATH Open0545.68053OpenAlexW2021469256MaRDI QIDQ797286FDOQ797286

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

Recommendations

• Balancing binary trees by internal path reduction
• Height balance distribution of search trees
• Efficient reorganization of binary search trees
• Improved bounds for the expected behaviour of AVL trees
• Expected Costs in Some Classes of Binary Search Trees

zbMATH Keywords

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

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• On random 2-3 trees
• Locally balanced binary trees
• Title not available (Why is that?)
• Binary search trees with limited rotation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797286)