#include<iostream>
#include<stack>
#include<queue>
const int maxsize=100;
int index;
using namespace std;
typedef int ElemType;
typedef struct BSTNode{
ElemType data;
struct BSTNode *lchild,*rchild;
}BSTNode,*BSTree;
void visit(BSTree T)
{
cout<<T->data<<" ";
}
void InOrderLoop(BSTree T)
{//中序遍历循环策略
cout<<"the InorderLoop of tree is: ";
stack<BSTree> s;
BSTree p=T;
while(p||!s.empty()){
if(p){
s.push(p);
p=p->lchild;
}
else{
p=s.top();
s.pop();
visit(p);
p=p->rchild;
}
}
cout<<endl;
}
void LevelOrder(BSTree T){
//层序遍历遍历二叉树
cout<<"the Levelorder of tree is: ";
queue<BSTree> q;
BSTree p=T;
q.push(p);
while(!q.empty()){
p=q.front();
q.pop();
visit(p);
if(p->lchild){
q.push(p->lchild);
}
if(p->rchild){
q.push(p->rchild);
}
}
cout<<endl;
}
BSTree SearchBSTree(BSTree T,ElemType key,BSTree &pre)
{//左边小,右边大
while(T&&key!=T->data){
if(key>T->data){//进入右子树,保存双亲
pre=T;
T=T->rchild;
}
else if(key<T->data){
pre=T;
T=T->lchild;
}
else break;
}
return T;
}
int InsertBSTree(BSTree &T,ElemType key)
{
BSTree pre=NULL;
if(SearchBSTree(T,key,pre)) return 0;//如果找到,插入失败
BSTree node=new BSTNode;
node->data=key;
node->lchild=node->rchild=0;
if(!pre) {//树是一个空树
T=node; return 1;
}
if(key>pre->data) pre->rchild=node;
else pre->lchild=node;
return 1;
}
//初始构造二叉排序树
void InitBSTree(BSTree &T){
int a[10]={45,24,53,45,12,24,90};
for(int i=0;i<7;i++)
InsertBSTree(T,a[i]);
}
int Delete(BSTree &p)
{
BSTree q,s;
if(!p->rchild){
q=p;
p=p->lchild;
free(q);
}
else if(!p->lchild){
q=p;
p=p->rchild;
free(q);
}
else{//q其右孩子的最左边
q=p;
s=p->lchild;
while(s->rchild)
{
q=s;
s=s->rchild;
}
if(q==p)
q->lchild=s->lchild; /*重接f的左子树*/
else
q->rchild=s->lchild; /*重接f的右子树*/
p->data=s->data;
free(s);
}
return 1;
}
int DeleteBSTree(BSTree &T,ElemType key)
{
if(!T) return 0;
else{
if(key==T->data) return Delete(T);
else if(key<T->data) DeleteBSTree(T->lchild,key);
else DeleteBSTree(T->rchild,key);
}
}
int main()
{
BSTree T=NULL;
ElemType key=53;
InitBSTree(T);
InOrderLoop(T);
LevelOrder(T);
InsertBSTree(T,37);
LevelOrder(T);
DeleteBSTree(T,key);
InOrderLoop(T);
LevelOrder(T);
DeleteBSTree(T,24);
LevelOrder(T);
system("pause");
return 0;
}
删除操作是整个的copy来的,看着我自己都迷迷糊糊的,拿着个树翻过来覆过去才略懂一二