实验六二叉树

实验六二叉树
#include<iostream.h>
#include<stdlib.h>
typedef char ElemType;
struct BTreeNode
{
ElemType data;
BTreeNode *left;
BTreeNode *right;
};
void InitBTree(BTreeNode*& BT)
{
BT=NULL;
}
void CreateBTree(BTreeNode*& BT,char *a) {
const int MaxSize=50;
BTreeNode*s[MaxSize];
int top=-1;
BT=NULL;
BTreeNode*p;
int k;
int i=0;
while (a[i])
{
switch(a[i])
{
case ' ':
break;
case '(':
if (top==MaxSize-1)
{
cout<<""<<endl;
exit(1);
}
top++;
s[top]=p;
k=1;
break;
case ')':
if(top=-1)
{
cout<<""<<endl;
exit(1);
}
top--;
break;
case ',':
k=2;
break;
default:
p=new BTreeNode;
p->data=a[i];
p->left=p->right=NULL;
if(BT==NULL)
BT=p;
else
{
if(k==1)
s[top]->left=p;
else
s[top]->right=p;
}
}
i++;
}
}
bool FindBTree(BTreeNode*BT,ElemType&x) {
if(BT==NULL)
return false;
else
{
if(BT->data==x)
{
x=BT->data;
return true;
}
else
{
if(FindBTree(BT->left,x))
return true;
if(FindBTree(BT->right,x))
return true;
return false;
}
}
}
int DepthTree(BTreeNode*BT)
{
if(BT==NULL)
return 0;
else
{
int dep1=DepthTree(BT->left);
int dep2=DepthTree(BT->right);
if(dep1>dep2)
return dep1+1;
else
return dep2+1;
}
}
bool EmptyBTree(BTreeNode*BT) {
return BT==NULL;
}
void PrintBTree(BTreeNode*BT) {
if(BT==NULL)
{
cout<<BT->data;
if(BT->left!=NULL || BT->right!=NULL)
{
cout<<'(';
PrintBTree(BT->left);
if(BT->right!=NULL)
cout<<',';
PrintBTree(BT->right);
cout<<')';
}
}
}
void LevelOrder(BTreeNode*BT)
{
const int MaxSize=30;
BTreeNode*q[MaxSize];
int front=0;
int rear=0;
BTreeNode*p;
if(BT==NULL)
{
rear=(rear+1)%MaxSize;
q[rear]=BT;
}
while(front!=rear)
{
front=(front+1)%MaxSize;
p=q[front];
cout<<p->data<<' ';
if(p->left!=NULL)
{
rear=(rear+1)%MaxSize;
q[rear]=p->left;
}
if(p->right!=NULL)
{
rear=(rear+1)%MaxSize;
q[rear]=p->right;
}
}
}
void ClearBTree(BTreeNode*&BT) {
if(BT!=NULL)
ClearBTree(BT->left);
ClearBTree(BT->right);
delete BT;
BT=NULL;
}
void main()
{
BTreeNode*bt;
InitBTree(bt);
char b[50];
cout<<"输入二叉树用广义表表示的字符串："<<endl;
cin.getline(b,sizeof(b));
CreateBTree(bt,b);
PrintBTree(bt);
cout<<endl;
cout<<"按层：";
LevelOrder(bt);
cout<<endl;
ElemType x;
cout<<"输入一个待查字符：";
cin>>x;
if(FindBTree(bt,x))
cout<<"查找字符"<<x<<"成功！"<<endl; else
cout<<"查找字符"<<x<<"失败！"<<endl; cout<<"深度：";
cout<<DepthTree(bt)<<endl;
ClearBTree(bt);
}。