AVL_tree的删除
来源:互联网 发布:华硕网络控制器驱动 编辑:程序博客网 时间:2024/06/05 21:07
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;
}
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;
}
0 0
- AVL_tree的删除
- AVL_tree
- AVL_Tree
- AVL_tree insert的实现代码
- linux内核的红黑树RB_TREE和freebsd 8.0里面的AVL_TREE比较 之一 RB_TREE
- 平衡二叉树(AVL_Tree)
- [数据结构]Binary_tree | Binary_search_tree | avl_tree
- 删除不能删除的文件
- 删除无法删除的文件
- 删除无法删除的文件夹
- 如何删除无法删除的文件
- 文件的删除与反删除
- ASP删除与批量删除的代码
- 删除那些无法被删除的文件
- 批处理彻底删除不能删除的文件
- 创建与删除无法删除的文件夹
- 如何删除桌面无法删除的图标
- 字符串删除,并统计删除的次数
- Spring & SpringSecurity 相关的文章
- C++输出操作符求值顺序
- SQLplus中arraysize设置.
- android开发之mac下jdk的安装及开发环境搭建
- java与scala集合相互转换
- AVL_tree的删除
- OCP 1Z0 052 9
- HAProxy+Keepalived实现Web服务器负载均衡
- spring配置datasource三种方式
- jQuery插件实现新浪微博自动底部加载
- 黑马程序员---dll 程序导出类声明
- Apache 的安装及Apache与php整合过程详解
- HteOS - Win10 Metro UI 风格的Web桌面
- 关于openCV图片裁剪和图片合并的问题