Title :
Rebalancing Height Balanced Trees
Author :
Luccio, Fabrizio ; Pagli, Linda
Author_Institution :
Istituto di Scienze dell´´Informazione, University of Pisa
fDate :
5/1/1978 12:00:00 AM
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.
Keywords :
Height balanced trees; information storage and retrieval; rebalancing; rotation; search length; Binary search trees; Binary trees; Computer science; Councils; Frequency; Information retrieval; Resumes; Height balanced trees; information storage and retrieval; rebalancing; rotation; search length;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1978.1675117
