Issue No. 05 - May (1978 vol. 27)
F. Luccio , Istituto di Scienze dell'Informazione, University of Pisa
A new balancing technique for binary search trees is presented, based on the repositioning of k + 1 nodes (k-rotation) Some properties of k-rotation are shown, and bounds to k are derived. The performance of such a technique is discussed on the basis of the length of node search and the frequency of tree rebalancing.
search length, Height balanced trees, information storage and retrieval, rebalancing, rotation
L. Pagli and F. Luccio, "Rebalancing Height Balanced Trees," in IEEE Transactions on Computers, vol. 27, no. , pp. 386-396, 1978.