Rebalancing Height Balanced Trees

Authors:
F. Luccio;L. Pagli
Affiliations:
Istituto di Scienze dell'Informazione, University of Pisa;-
Venue:
IEEE Transactions on Computers
Year:
1978

Citing 4
Cited 1

Binary Search Trees and File Organization

ACM Computing Surveys (CSUR)
Performance of height-balanced trees

Communications of the ACM
A generalization of AVL trees

Communications of the ACM
On the Height of Height-Balanced Trees

IEEE Transactions on Computers

Tree Search in Major/Minor Loop Magnetic Bubble Memories

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

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.