Abstract
iR trees are parameterized binary search trees which rebalance themselves locally. In our previous work the cases fori=1, 2 were studied. This note extends the result to arbitraryi. In particular, we derive a formula for the average number of rotations/reorganizations involved in an insertion and consequently a formula for the average number of comparisons for a successful search iniR trees.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. J. Bell:An investigation into the principles of the classification and analysis of data on an automatic digital computer, Doctoral Dissertation, Leeds University, 1965.
L.J. Guibas and R. Sedgewick:A dichromatic framework for balanced trees, 19th Symposium on Foundations of Computer Sciences, 1978, 8–21.
A. Itai and M. Rodeh:Modified binary search trees, Haifa Technion, CS-TR-182, 1980.
S. H. Huang and C. K. Wong:Binary search trees with limited rotation, BIT 23, 436–455, 1983.
D. Knuth:The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, Mass. (1968).
D. Knuth:The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, Mass. (1973).
T. Ottmann, H.-W. Six and D. Wood:The Analysis of Search Trees: A Survey, Lecture Notes in Computer Science 100, Springer-Verlag, 234–249, 1980.
E. M. Reingold, J. Nievergelt and N. Deo:Combinatorial Algorithms: Theory and Practice, Prentice-Hall, Englewood Cliffs, New Jersey (1977).
A. Walker and D. Wood:Locally balanced binary trees, The Computer Journal, 19,4 (1976), 322–325.
A. C. Yao:On random 2–3 trees, Acta Informatica, 9 (1978), 159–170.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Huang, SH.S., Wong, C.K. Average number of rotations and access cost in iR-trees. BIT 24, 387–390 (1984). https://doi.org/10.1007/BF02136039
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02136039