About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Abstract
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.