On the average number of rebalancing operations in weight-balanced trees

Norbert Blum, Kurt Mehlhorn
1980 Theoretical Computer Science  
It is shown that the average number of rebalancing operations (rotations and double rotations) in weight-balanced trees is constant.
doi:10.1016/0304-3975(80)90018-3 fatcat:ytvaeuhex5ah7piakmecfa2dsi