实验题目:
实现二叉树各种基本运算的算法
实验目的:
领会二叉链存储结构和掌握二叉树中各种基本运算算法设计
实验内容:
编写一个程序btree.cpp,实现二叉树的基本运算,在此基础上,编写exp7-1.cpp,完成如下功能:
1、由二叉树创建对应的二叉链存储结构b,该二叉树的括号表示串为 "A(B(D,E(H(J,K(L,M(,N))))),C(F,G(,I)))"。
2、输出二叉树b
3、输出'H'结点的左、右孩子结点值
4、输出二叉树b的高度
5、释放二叉树b
btree.cpp如下:
//
// Created by liushihao on 19-4-26.
//
#include "iostream"
#define Maxsize 100
using namespace std;
typedef char ElemType;
typedef struct node
{
ElemType data;
struct node *lchild;
struct node *rchild;
}BTNode;
void CreateBTree(BTNode * &b, char *str) //创造二叉树
{
BTNode *St[Maxsize], *p;
int top=-1,k,j=0;
char ch;
b=NULL;
ch=str[j];
while(ch!='\0')
{
switch (ch)
{
case '(':top++;St[top]=p;k=1;break;
case ')':top--; break;
case ',':k=2; break;
default:
p=(BTNode*)malloc(sizeof(BTNode));
p->data=ch;
p->lchild=p->rchild=NULL;
if(b==NULL)
b=p;
else
{
switch(k)
{
case 1:St[top]->lchild=p;break;
case 2:St[top]->rchild=p;break;
}
}
}
j++;
ch=str[j];
}
}
void DestroyBtree(BTNode *&b) //销毁二叉树
{
if(b!=NULL)
{
DestroyBtree(b->lchild);
DestroyBtree(b->rchild);
free(b);
}
}
BTNode *FindNode(BTNode *b,ElemType x)
{
BTNode *p;
if(b==NULL)
{
return NULL;
}
else if(b->data==x)
{
return b;
}
else
{
p=FindNode(b->lchild, x);
if(p!=NULL)
{
return p;
}
else
{
return FindNode(b->rchild, x);
}
}
}
BTNode *LchildNode(BTNode *p)
{
return p->lchild;
}
BTNode *RchildNode(BTNode *p)
{
return p->rchild;
}
int BTHeight(BTNode *b)
{
int lchildh,rchildh;
if(b==NULL) return 0;
else
{
lchildh=BTHeight(b->lchild);
rchildh=BTHeight(b->rchild);
return (lchildh>rchildh)? (lchildh+1):(rchildh+1);
}
}
void DispBTree(BTNode *b)
{
if(b!=NULL)
{
cout<<b->data;
if(b->lchild!=NULL || b->rchild!=NULL)
{
cout<<"(";
DispBTree(b->lchild);
if(b->rchild!= NULL) cout<<",";
DispBTree(b->rchild);
cout<<")";
}
}
}
exp7-1.cpp如下:
#include "btree.h"
int main()
{
BTNode *b;
char str[]="A(B(D,E(H(J,K(L,M(,N))))),C(F,G(,I)))";
CreateBTree(b, str);
cout<<"初始化二叉树为:"<<endl;
DispBTree(b);
cout<<endl;
cout<<"H结点的左结点:"<<LchildNode(FindNode(b,'H'))->data<<" 右结点:"<<RchildNode(FindNode(b,'H'))->data<<endl;
cout<<"二叉树的高度为:"<<endl;
cout<<BTHeight(b)<<endl;
DestroyBtree(b);
return 0;
}