Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
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.
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications
Sankar Basu
Journal of the Franklin Institute
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998