This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
May 1978 (vol. 27 no. 5)
pp. 386-396
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.
Index Terms:
search length, Height balanced trees, information storage and retrieval, rebalancing, rotation
Citation:
F. Luccio, L. Pagli, "Rebalancing Height Balanced Trees," IEEE Transactions on Computers, vol. 27, no. 5, pp. 386-396, May 1978, doi:10.1109/TC.1978.1675117
Usage of this product signifies your acceptance of the Terms of Use.