AVL_tree的删除

template <class Record>
Error_code AVL_tree<Record>::avl_remove(Binary_node<Record> *&sub_root, Record &new_data, bool &shorter)
{
Error_code result=success;
Record sub_record;
if(sub_root==NULL)
{
shorter=false;
return not_present;
}
else if(new_data==sub_root->data)
{
Binary_node<Record>*to_delete=sub_root;
if(sub_root->right==NULL)
{
sub_root=sub_root->left;
shorter=true;
delete to_delete;
return success;
}
else if(sub_root->left==NULL)
{
sub_root=sub_root->right;
shorter=true;
delete to_delete;
return success;
}
else
{
to_delete=sub_root->left;
Binary_node<Record>*parent=sub_root;
while(to_delete->right!=NULL)
{
parent=to_delete;
to_delete=to_delete->right;
}
new_data=to_delete->data;
sub_record=new_data;
}
}


if(new_data<sub_root->data)
{
result=avl_remove(sub_root->left,new_data,shorter);
if(shorter=true)
switch(sub_root->get_balance())
{
case left_higher:
sub_root->set_balance(equal_height);
break;
case equal_height:
sub_root->set_balance(right_higher);
break;
case right_higher:
if(sub_record.the_key()!=0)
sub_root->data=sub_record;
shorter=right_balance2(sub_root);
break;
}
}
if (new_data > sub_root->data) 
{ 
result = avl_remove(sub_root->right, new_data, shorter);
if (shorter == true)
switch (sub_root->get_balance( ))
{ 
case left_higher:
if(sub_record.the_key()!=0)sub_root->data = sub_record; 
shorter = left_balance2(sub_root);
break;
case equal_height:
sub_root->set_balance(left_higher);
shorter = false;
break;
case right_higher:
sub_root->set_balance(equal_height);
break;
}  
} 
return result;
}