B树删除求C/C++代码
按照严蔚敏的C数据结构的定义写个删除函数出来，B树纠结了很久，就是不会写删除。。。
[最优解释]
该回复于2012-10-12 10:39:36被版主删除
[其他解释]
void DestroyTree(BTNode *bt)
{
if(bt && bt->lchild)
DestroyTree(bt->lchild);
if(bt && bt->lchild)
DestroyTree(bt->rchild);
printf("%d",bt->data);
free(bt);
}
#include<iostream>
using namespace std;
int N=2;
.cpp放这段
int main()
{
for(int i=0;i<N;i++)
cout<<"HelloWorld"<<end;
retunrn 0;
}
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#define NULL 0
typedef struct tree{
char Data;
struct tree *left,*right;
}*Bitree;
Bitree create(Bitree T)
{
char ch;
scanf("%c",&ch);
if(ch=='#')//输入#号表示空
{
T=NULL;
}
else
{
if(!(T=(Bitree )malloc(sizeof(Bitree))))
{
printf("错误!\n");
}
T->Data=ch;
T->left=create(T->left);
T->right=create(T->right);
}
return T;
}
void xianxu(Bitree T)
{
if(T)
{
printf("%c",T->Data);
xianxu(T->left);
xianxu(T->right);
}
}
void zhongxu(Bitree T)
{
if(T)
{
zhongxu(T->left);
printf("%c",T->Data);
zhongxu(T->right);
}
}
void houxu(Bitree T)
{
if(T)
{
houxu(T->left);
houxu(T->right);
printf("%c",T->Data);
}
}
void main()
{
Bitree T;
T=create(T);
xianxu(T);
printf("\n");
zhongxu(T);
printf("\n");
houxu(T);
printf("\n");
}
非递归先中后的遍历算法
C/C++ code
//1.先序遍历非递归算法
#define maxsize 100
typedef struct
{
Bitree Elem[maxsize];
int top;
}SqStack;
void PreOrderUnrec(Bitree t)
{
SqStack s;
StackInit(s);
p=t;
while (p!=null
[其他解释]
!StackEmpty(s))
{
while (p!=null) //遍历左子树
{
visite(p->data);
push(s,p);
p=p->lchild;
}//endwhile
if (!StackEmpty(s)) //通过下一次循环中的内嵌while实现右子树
遍历
{
p=pop(s);
p=p->rchild;
}//endif
}//endwhile
}//PreOrderUnrec
//2.中序遍历非递归算法
#define maxsize 100
typedef struct
{
Bitree Elem[maxsize];
int top;
}SqStack;
void InOrderUnrec(Bitree t)
{
SqStack s;
StackInit(s);
p=t;
while (p!=null
[其他解释]
!StackEmpty(s))
{
while (p!=null) //遍历左子树
{
push(s,p);
p=p->lchild;
}//endwhile
if (!StackEmpty(s))
{
p=pop(s);
visite(p->data); //访问根结点
p=p->rchild; //通过下一次循环实现右子树遍历
}//endif
}//endwhile
}//InOrderUnrec
//3.后序遍历非递归算法
#define maxsize 100
typedef enum{L,R} tagtype;
typedef struct
{
Bitree ptr;
tagtype tag;
}stacknode;
typedef struct
{
stacknode Elem[maxsize];
int top;
}SqStack;
void PostOrderUnrec(Bitree t)
{
SqStack s;
stacknode x;
StackInit(s);
p=t;
do
{
while (p!=null) //遍历左子树
{
x.ptr = p;
x.tag = L; //标记为左子树
push(s,x);
p=p->lchild;
}
while (!StackEmpty(s) && s.Elem[s.top].tag==R)
{
x = pop(s);
p = x.ptr;
visite(p->data); //tag为R，表示右子树访问完毕，故访问根结点
}
if (!StackEmpty(s))
{
s.Elem[s.top].tag =R; //遍历右子树
p=s.Elem[s.top].ptr->rchild;
}
}while (!StackEmpty(s));
}//PostOrderUnrec
//求二叉树的深度
int Depth(BiTNode *T)
{
int dep1,dep2;
if(T==NULL)
return(0);
else
{
dep1=Depth(T->lchild);
dep2=Depth(T->rchild);
if(dep1>dep2)
return(dep1+1);
else
return(dep2+1);
}
}
//输出二叉树
void Disptree(BiTNode *T)
{
if(T)
{
printf("%c",T->data);
if(T->lchild
[其他解释]
T->rchild)
{
printf("(");
Disptree(T->lchild);
if(T->rchild)
printf(",");
Disptree(T->rchild);
printf(")");
}
}
[其他解释]
而已
void DestroyTree(BTNode *bt)
{
if(bt && bt->lchild)
DestroyTree(bt->lchild);
if(bt && bt->lchild)
DestroyTree(bt->rchild);
printf("%d",bt->data);
free(bt);
}
