AVL_tree insert的实现代码

最新推荐文章于 2023-06-20 00:29:35 发布

**：天下第一

最新推荐文章于 2023-06-20 00:29:35 发布

阅读量935

点赞数

分类专栏： c++_tree 文章标签： avl tree

本文链接：https://blog.csdn.net/u013200703/article/details/29196009

版权

c++_tree 专栏收录该内容

41 篇文章 0 订阅

订阅专栏

template <class Record>
Error_code AVL_tree<Record>::avl_insert(Binary_node<Record> *&sub_root, const Record &new_data, bool &taller)
{
Error_code result=success;
if(sub_root=NULL)
{
sub_root=new Binary_node<Record>(new_data);
taller=true;
}
else if(new_data=sub_root->data)
{
result=duplicate_error;
taller=false;
}
else if(new_data<sub_root->data)
{
result=avl_insert(sub_root->left,new_data,taller);
if(taller==true)
switch(sub_root->get_balance())
{
case right_higher:
sub_root->set_balance(equal_height);
taller=true;
break;
case equal_balance:
sub_root->set_balance(left_higher);
break;
case left_higher:
left_balance(sub_root);
taller=false;
break;
}
}
else
{
result=avl_insert(sub_root->right,new_data,taller);
if(taller==true)
switch(sub_root->get_balance())
{
case left_higher:
sub_root->set_balance(equal_height);
taller=false;
break;
case equal_height:
sub_root->set_balance(right_higher);
break;
case right_higher:
right_balance(sub_root);
taller=false;
break;
}
}
return result;
}