F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
iR trees are parameterized binary search trees which rebalance themselves locally. In our previous work the cases for i=1, 2 were studied. This note extends the result to arbitrary i. 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 in iR trees. © 1984 BIT Foundations.
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
M.B. Small, R.M. Potemski
Proceedings of SPIE 1989