The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1978 vol.27)
pp: 386-396
F. Luccio , Istituto di Scienze dell'Informazione, University of Pisa
ABSTRACT
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
25 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool