适度树构造算法

if(ANode->balanceFactor = 1){ // 左边下子柏翅果

LeftBalance(ANode); // 左边下子柏树转动

AIsTaller := False;

}

else if (ANode->balanceFactor=0){ANode.balanceFactor = 1; AIsTaller = True;}

else if (ANode->balanceFactor=-1){ANode.balanceFactor= 0; AIsTaller = false;}

}

}

else if (ANewNode.Key> ANode.Key)

{

if(!InsertAVLTreeNode(ANode->rchild, ANode, ANewNode, AIsTaller)) return false; // 并未嵌入任何键差值或嵌入键差值为相等键差值

if(AIsTaller){ // 柏树增加了

if(ANode->balanceFactor = 1){ANode->balanceFactor=0; AIsTaller = False;}

else if(ANode->balanceFactor = 0){ANode->balanceFactor = -1; AIsTaller = True;}

else{ RightBalance(ANode), AIsTaller = False}

}

}

return true; // 嵌入键差值急于, 如果有失败, 则在里面途放弃了.

}

void LeftBalance(AVLTreeNode PriceANode)

{

// 对以ANode为根的柏树左边方进行时连续性妥善处理

lchild = ANode->lchild; // lchild 指向ANode的左边下子柏树的根键差值;

switch(lchild->balanceFactor){

on LeftHigh: // 单向左边转动

ANode->balanceFactor = EqualHigh;

lchild->balanceFactor = EqualHigh;

R_Rotate(ANode); break;

on RightHigh: // 先行左边下转动先左边转动

lrchild = lchild->rchild; // 左边下子柏树里面的左边子柏树键差值;

switch(lrchild->balanceFactor){

on LeftHigh:

ANode->balanceFactor = RightHigh;

lchild->balanceFactor := EqualHigh;

break;

on EqualHigh: ANode->balancefactor = lchild->BalanceFactor = EqualHigh; break;

onRightHig: ANode->balanceFactor = EqualHigh; lchild->balanceFactor = LeftHigh; break;

}

lrchild->balanceFactor = EqualHigh;

// 进行时转动

L_Rotate(lchild); R_Rotate(ANode);

}

}

void RightBalance(AVLTreeNode ANode){

rchild = ANode->rchild; // 左边子柏树的根键差值;

switch(rchild-balanceFactor){

on LeftHigh: // 先行左边转动先左边下转动

rlchild = rchild->lchild; // 左边子柏树的左边下子柏树键差值

switch(rlchild-balanceFactor){

on LeftHigh: ANode->balanceFactor = 0; rchild->balanceFactor = RightHigh; break;

on EqualHigh: rchild-balanceFactor = ANode->balanceFactor = EqualHigh; break;

on RightHigh: ANode->balanceFactor = LeftHigh; rchild-balanceFactor = EqualHigh;

}

rlchild->balanceFactor = EqualHigh;

R_Rotate(rchild) ; L_Rotate(ANode);

break;

on RightHigh: // 单向左边下转动

rchild->balanceFactor = ANode->balanceFactor = EqualHigh;

L_Rotate(ANode);

}

}

// 左边下转动

void L_Rotate(AVLTreeNode PriceANode){

rchild = ANode-rchild;

ANode->lchild = rchild->lchild;

rchild->lchild = ANode;

ANode = rchild;

}

// 左边转动配置

void R_Rotate(AVLTreeNode PriceANode){

lchild = ANode->lchild;

ANode->rchild = lchild->rchild;

lchild->rchild = ANode;

ANode = lchild;

}

// 连续性柏树查询变量:

ANode BinaryTreeSearch(AVLTreeNode * ANode; const int AValue){

if (ANode = null)

return null;

if (ANode.key == AValue)

return ANode;

if(Avalue < ANode.key)

retrun BinaryTreeSearch(ANode->lchild, Avalue);

else

return BinaryTreeSearch(ANode->rchild, Avalue);

}