一、实验目的
1、 熟练理解树和二叉树的相关概念,掌握的存储结构和相关操作实现;
2、 掌握树的顺序结构的实现;
3、 学会运用树的知识解决实际问题
二、 实验内容
自己确定一个二叉树(树结点类型、数目和结构自定)利用链式存储结构方法存储。实 现树的构造,并完成:
1) 用前序遍历、中序遍历、后序遍历输出结点数据;
2) 以合理的格式,输出各个结点和双亲、孩子结点信息;
3) 输出所有的叶子结点信息;
三、实验步骤
完整程序;
#ifndef BiTree_H
#define BiTree_H
const int Max=20;
struct BiNode
{
char data;
BiNode*lchild,*rchild;
};
class BiTree
{
public:
BiTree(){root=Creat(root);}
~BiTree(){Release(root);}
void PreOrder(){PreOrder(root);}
void InOrder(){InOrder(root);}
void PostOrder(){PostOrder(root);}
void FamilyOrder(){FamilyOrder(root);}
void InOrder_PrintLeaf(){InOrder_PrintLeaf(root);}
private:
BiNode*root;
BiNode*Creat(BiNode*bt);
void Release(BiNode*bt);
void PreOrder(BiNode*bt);
void InOrder(BiNode*bt);
void PostOrder(BiNode*bt);
void FamilyOrder(BiNode*bt);
void InOrder_PrintLeaf(BiNode*bt);
};
#endif
#include<iostream>
using namespace std;
#include"Bitree.h"
BiNode*BiTree::Creat(BiNode*bt)
{
char ch;
cout<<"请输入创建一棵二叉树的结点数据"<<endl;
cin>>ch;
if(ch=='#')return NULL;
else{
bt=new BiNode;
bt->data=ch;
bt->lchild=Creat(bt->lchild);
bt->rchild=Creat(bt->rchild);
}
return bt;
}
void BiTree::Release(BiNode*bt)
{
if(bt!=NULL){
Release(bt->lchild);
Release(bt->rchild);
delete bt;
}
}
void BiTree::PreOrder(BiNode*bt)
{
if(bt==NULL)return;
else{
cout<<bt->data<<" ";
PreOrder(bt->lchild);
PreOrder(bt->rchild);
}
}
void BiTree::InOrder(BiNode*bt)
{
if(bt==NULL)return;
else{
InOrder(bt->lchild);
cout<<bt->data<<" ";
InOrder(bt->rchild);
}
}
void BiTree::PostOrder(BiNode*bt)
{
if(bt==NULL)return;
else{
PostOrder(bt->lchild);
PostOrder(bt->rchild);
cout<<bt->data<<" ";
}
}
void BiTree::FamilyOrder(BiNode*bt)
{
if(bt==NULL)return;
else{
cout<<"双亲:"<<bt->data;
if(bt->lchild!=NULL) cout<<"左孩子:"<<bt->lchild->data<<" ";
if(bt->rchild!=NULL) cout<<"右孩子:"<<bt->rchild->data<<endl;
if(bt->lchild==NULL&&bt->rchild==NULL) cout<<"无孩子结点"<<endl;
FamilyOrder(bt->lchild);
FamilyOrder(bt->rchild);
}
}
void BiTree::InOrder_PrintLeaf(BiNode*bt)
{
if(bt==NULL)return;
else{
InOrder_PrintLeaf(bt->lchild);
if(bt->lchild==NULL&&bt->rchild==NULL)
cout<<bt->data<<" ";
InOrder_PrintLeaf(bt->rchild);
}
}
#include<iostream>
using namespace std;
#include"Bitree.h"
int main()
{
BiTree T;
cout<<"------前序遍历------"<<endl;
T.PreOrder();
cout<<endl;
cout<<"------中序遍历------"<<endl;
T.InOrder();
cout<<endl;
cout<<"------后序遍历------"<<endl;
T.PostOrder();
cout<<endl;
cout<<"------双亲结点及孩子结点------"<<endl;
T.FamilyOrder();
cout<<endl;
cout<<"------叶子结点------"<<endl;
T.InOrder_PrintLeaf();
cout<<endl;
return 0;
}
运行结果: