实验12 动态查找 二叉排序树
代码
#include <iostream>
using namespace std;
#define ENDFLAG '#'
struct ElemType
{
char key;
};
struct BSTNode
{
ElemType data;
BSTNode *lchild, *rchild;
};
using BSTree = BSTNode *;
BSTree SearchBST(BSTree T, char key)
{
if (!T || T->data.key == key)
return T;
else if (key < T->data.key)
return SearchBST(T->lchild, key);
else
return SearchBST(T->rchild, key);
}
void InsertBST(BSTree &T, ElemType e)
{
if (!T)
{
BSTNode *node = new BSTNode;
node->data = e;
node->lchild = node->rchild = nullptr;
T = node;
}
else if (e.key < T->data.key)
InsertBST(T->lchild, e);
else if (e.key > T->data.key)
InsertBST(T->rchild, e);
}
void CreateBST(BSTree &T)
{
T = nullptr;
ElemType e;
cin >> e.key;
while (e.key != ENDFLAG)
{
InsertBST(T, e);
cin >> e.key;
}
}
void DeleteBST(BSTree &T, char key)
{
BSTree target = T;
BSTree parent = nullptr;
while (target)
{
if (target->data.key == key)
break;
parent = target;
if (target->data.key > key)
target = target->lchild;
else
target = target->rchild;
}
if (!target)
return;
if ((target->lchild) && (target->rchild))
{
BSTree pre = target->lchild;
BSTree parent_of_pre = nullptr;
while (pre->rchild)
{
parent_of_pre = pre;
pre = pre->rchild;
}
target->data = pre->data;
parent_of_pre->rchild = pre->lchild;
delete pre;
return;
}
BSTree to_replace = nullptr;
if (!target->lchild)
to_replace = target->rchild;
else if (!target->rchild)
to_replace = target->lchild;
if (!parent)
T = to_replace;
else if (target == parent->lchild)
parent->lchild = to_replace;
else if (target == parent->rchild)
parent->rchild = to_replace;
delete target;
}
void InOrderTraverse(BSTree &T)
{
if (T)
{
InOrderTraverse(T->lchild);
cout << T->data.key << '\t';
InOrderTraverse(T->rchild);
}
}
int main()
{
BSTree T;
cout << "请输入若干字符(#表示输入结束): ";
CreateBST(T);
cout << "中序遍历结果为" << endl;
InOrderTraverse(T);
cout << endl;
char key;
cout << "请输入待查找字符: ";
cin >> key;
if (SearchBST(T, key))
cout << "找到字符" << key << endl;
else
cout << "未找到" << key << endl;
cout << "请输入待删除的字符: ";
cin >> key;
DeleteBST(T, key);
cout << "中序遍历结果为" << endl;
InOrderTraverse(T);
cout << endl;
}
截图
![](https://img2020.cnblogs.com/blog/1824307/202012/1824307-20201201190858584-1642729984.png)
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 为什么说在企业级应用开发中,后端往往是效率杀手?
· 用 C# 插值字符串处理器写一个 sscanf
· Java 中堆内存和栈内存上的数据分布和特点
· 开发中对象命名的一点思考
· .NET Core内存结构体系(Windows环境)底层原理浅谈
· 为什么说在企业级应用开发中,后端往往是效率杀手?
· DeepSeek 解答了困扰我五年的技术问题。时代确实变了!
· 本地部署DeepSeek后,没有好看的交互界面怎么行!
· 趁着过年的时候手搓了一个低代码框架
· 推荐一个DeepSeek 大模型的免费 API 项目!兼容OpenAI接口!