查找二叉树
来源:互联网 发布:淘宝网店怎么起步快 编辑:程序博客网 时间:2024/05/17 07:40
#include "Search_tree.h"
template <class Record>
Binary_node<Record>* Search_tree<Record>::search_for_node(Binary_node<Record> *sub_root, const Record &target) const
{
if(sub_root==NULL||sub_root->data==target)
return sub_root;
if(sub_root<target)
return search_for_node(sub_root->right,target);
else
return search_for_node(sub_root->left,target);
}
template <class Record>
Error_code Search_tree<Record>::tree_search(Record &x)const
{
Error_code outcome=success;
Binary_node<Record>* found=search_for_node(root,x);
if(found==NULL)
outcome=not_present;
else
target=found->data;
return outcome;
}
template <class Record>
Error_code Search_tree<Record>::search_and_insert(Binary_node<Record> *&sub_root, const Record &target)
{
if(sub_root==NULL)
{
sub_root=new Binary_node<Record>(target);
return success;
}
if(sub_root->data<target)
search_and_insert(sub_root->right,target);
else if(sub_root->data>target)
search_and_insert(sub_root->left,target);
else
return duplicate_error;
}
template <class Record>
Error_code Search_tree<Record>::insert(const Record &x)
{
Error_code outcome=search_and_insert(root,x);
if(outcome==success) count++;
return outcome;
}
template <class Record>
Error_code Search_tree<Record>::remove_root(Binary_node<Record> *&sub_root)
{
if(sub_root==NULL)
return not_present;
Binary_node<Record>*to_delete=sub_root;
if(sub_root->right==NULL) sub_root=sub_root->left;
else if(sub_root->left==NULL)sub_root=sub_root->right;
else
{
to_delete=sub_root->left;
Binary_node<Record>*parent=sub_root;
while(to_delete->right)
{
parent=to_delete;
to_delete=to_delete->right;
}
sub_root->data=to_delete->data;
if(parent==sub_root)
sub_root->left=to_delete->left;
else
parent->right=to_delete->left;
}
delete to_delete;
return success;
}
template <class Record>
Error_code Search_tree<Record>::search_and_destory(Binary_node<Record> *&sub_root, const Record &target)
{
if(sub_root==NULL||sub_root->data==target)
return remove_root(sub_root);
if(sub_root->data<target)
return search_and_destory(sub_root->right,target);
else
return search_and_destory(sub_root->left,target);
}
template <class Record>
Error_code Search_tree<Record>::remove(const Record &x)
{
Error_code result=search_and_destory(root,x);
if(result==success)
count--;
return result;
}
template <class Record>
Binary_node<Record>* Search_tree<Record>::search_for_node(Binary_node<Record> *sub_root, const Record &target) const
{
if(sub_root==NULL||sub_root->data==target)
return sub_root;
if(sub_root<target)
return search_for_node(sub_root->right,target);
else
return search_for_node(sub_root->left,target);
}
template <class Record>
Error_code Search_tree<Record>::tree_search(Record &x)const
{
Error_code outcome=success;
Binary_node<Record>* found=search_for_node(root,x);
if(found==NULL)
outcome=not_present;
else
target=found->data;
return outcome;
}
template <class Record>
Error_code Search_tree<Record>::search_and_insert(Binary_node<Record> *&sub_root, const Record &target)
{
if(sub_root==NULL)
{
sub_root=new Binary_node<Record>(target);
return success;
}
if(sub_root->data<target)
search_and_insert(sub_root->right,target);
else if(sub_root->data>target)
search_and_insert(sub_root->left,target);
else
return duplicate_error;
}
template <class Record>
Error_code Search_tree<Record>::insert(const Record &x)
{
Error_code outcome=search_and_insert(root,x);
if(outcome==success) count++;
return outcome;
}
template <class Record>
Error_code Search_tree<Record>::remove_root(Binary_node<Record> *&sub_root)
{
if(sub_root==NULL)
return not_present;
Binary_node<Record>*to_delete=sub_root;
if(sub_root->right==NULL) sub_root=sub_root->left;
else if(sub_root->left==NULL)sub_root=sub_root->right;
else
{
to_delete=sub_root->left;
Binary_node<Record>*parent=sub_root;
while(to_delete->right)
{
parent=to_delete;
to_delete=to_delete->right;
}
sub_root->data=to_delete->data;
if(parent==sub_root)
sub_root->left=to_delete->left;
else
parent->right=to_delete->left;
}
delete to_delete;
return success;
}
template <class Record>
Error_code Search_tree<Record>::search_and_destory(Binary_node<Record> *&sub_root, const Record &target)
{
if(sub_root==NULL||sub_root->data==target)
return remove_root(sub_root);
if(sub_root->data<target)
return search_and_destory(sub_root->right,target);
else
return search_and_destory(sub_root->left,target);
}
template <class Record>
Error_code Search_tree<Record>::remove(const Record &x)
{
Error_code result=search_and_destory(root,x);
if(result==success)
count--;
return result;
}
0 0
- 查找--二叉查找树
- 二叉树、二叉查找树
- 二叉树 & 二叉查找树
- 【查找结构】二叉查找树
- 查找之二叉树查找
- 查找之二叉树查找
- 查找:二叉查找树总结
- 二叉树查找树...
- 二叉树查找树
- 查找--遍历二叉树
- 二叉查找树
- 二叉查找树实现
- 二叉查找树
- 动态二叉查找树
- 最优二叉查找树
- 二叉查找树
- 二叉查找树
- 平衡二叉查找树
- 闲聊jpg和rar合并的秘密
- ffmpeg(8) AVIOContext II
- vs2005生成sqlite3.lib
- 删除指定数据库所有表
- 拓扑排序
- 查找二叉树
- SQLite C++操作类
- 杭电2047 阿牛的EOF牛肉串
- 动态规划入门策略—“最长公共子序列”
- 浅析error LNK2001: unresolved external symbol "public: __thisc...
- 从最大似然到EM算法浅解
- 你对baidu对一个网站的审阅期晓得多少?
- 毕业设计 论文写作小技巧、答辩注意事项
- OCP-1Z0-051 补充题库 第10题 集合操作中的ORDER BY子句