Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
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.
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
A. Skumanich
SPIE OE/LASE 1992
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007