同济大学计算机编程.ppt

再以结点E为旋转轴，将结点A顺时针旋转。使之平衡化。 右单 旋转 A E h h C D h-1 h B F G 0 -2 -2 F G D h A h-1 C E B 0 0 -1 h h template class Type void AVLTreeType :: LeftBalance ( AVLNodeType * Tree, int taller ) { AVLNodeType *leftsub = Tree-left, *rightsub; switch ( leftsub-balance ) { case -1 : Tree-balance = leftsub-balance = 0; RotateRight ( Tree, Tree ); taller = 0; break; case 0 : cout “树已经平衡化.\n; break; case 1 : rightsub = leftsub-right; switch ( rightsub-balance ) { case -1: Tre