#include<iostream.h>
#include<stdlib.h>
#define OK 1
#define ERROR 0
#define OVERFLOW -2
#define TRUE 1
#define FLASE 0
typedef int Status;
typedef int ElemType;
typedef char TElemType;
typedef struct BiTNode //结点定义,二叉树的链表存储表示
{
TElemType data;
struct BiTNode * lchild, * rchild; //左右孩子指针
}BiTNode,*BiTree;
//构造空二叉树 T
void InitBiTree(BiTree &T)
{
T=NULL;
cout<<"空二叉树已建立;"<<endl;
}
//先序遍历输入二叉树
void CreateBiTree(BiTree &T)
{
char ch;
cin>>ch;
if(ch=='@')
T=NULL;
else
{
T=(BiTNode *)malloc(sizeof(BiTNode));
if(!T)
exit(OVERFLOW);
else
{
T->data=ch;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
}
}
Status visit(BiTree T)
{
cout<<T->data;
return OK;
}
//二叉树 T 存在,visit 是对结点操作的应用函数
//先序遍历 T,对每个结点调用函数 visit 一次且仅一次。
//一旦 visit() 失败,则操作失败
Status PreOrderTraverse(BiTree T)
{//先序遍历二叉树
if(T)
{
if(visit(T))
if(PreOrderTraverse(T->lchild))
if(PreOrderTraverse(T->rchild))
return OK;
return ERROR;
}
else
return OK;
}
Status InOrderTraverse(BiTree T)
{//中序遍历二叉树
if(T)
{
if(InOrderTraverse(T->lchild))
if(visit(T))
if(InOrderTraverse(T->rchild))
return OK;
return ERROR;
}
else
return OK;
}
Status PostOrderTraverse(BiTree T)
{//后序遍历二叉树
if(T)
{
if(PostOrderTraverse(T->lchild))
if(PostOrderTraverse(T->rchild))
if(visit(T))
return OK;
return ERROR;
}
else
return OK;
}
int BiTreeDepth(BiTree T)
{//树的深度
if (T == NULL)
return 0;
else
{
int m = BiTreeDepth(T->lchild);
int n = BiTreeDepth(T->rchild);
if (m>n) return (m + 1);
else return (n + 1);
}
}
int NodeCount(BiTree T)
{//统计二叉树中结点的个数
if (T == NULL) return 0;
else return NodeCount(T->lchild) + NodeCount(T->rchild) + 1;
}
int LeafCount(BiTree T)
{//统计二叉树中叶子结点的个数
if (!T) return 0;
if (!T->lchild && !T->rchild) {//如果二叉树左子树和右子树皆为空,说明该二叉树根节点为叶子节点,加1.
return 1;
}
else {
return LeafCount(T->lchild) + LeafCount(T->rchild);
}
}
int Node_1_Count(BiTree T)
{//统计二叉树的度为1的结点个数
if (!T) return 0;
if ((!T->lchild) && (T->rchild) || (T->lchild) && (!T->rchild))
return 1 + Node_1_Count(T->lchild) + Node_1_Count(T->rchild);
else
return Node_1_Count(T->lchild) + Node_1_Count(T->rchild);
}
void PrintAllPath(BiTree T, char path[], int pathlen)
{//二叉树中从每个叶子结点到根结点的路径
int i;
if (T != NULL) {
path[pathlen] = T->data; //将当前结点放入路径中
if (T->lchild == NULL && T->rchild == NULL) {//叶子结点
for (i = pathlen; i >= 0; i--)
cout << path[i] << " ";
cout << endl;
}
else {
PrintAllPath(T->lchild, path, pathlen + 1);
PrintAllPath(T->rchild, path, pathlen + 1);
}
}
}
void DblOrderTraverse(BiTree T)
{//二叉树的双序遍历
if (T)
{
cout << T->data;
DblOrderTraverse(T->lchild);
cout << T->data;//访问两遍
DblOrderTraverse(T->rchild);
}
}
void DestroyBiTree(BiTree &T)
{
if(T)
{
if(T->lchild)
DestroyBiTree(T->lchild);
if(T->rchild)
DestroyBiTree(T->rchild);
free(T);
T=NULL;
}
}
//判空
void BiTreeEmpty(BiTree T)
{
if(T!=NULL)
cout<<(" FALSE!")<<endl;
else
cout<<(" TRUE!";
}
void main ()
{
BiTree T;
InitBiTree(T);
cout<<"按先序序列输入二叉树('@'表示空树)"<<endl;
CreateBiTree(T);
cout<<endl;
DestroyBiTree(T);//销毁二叉树
cout<<"先序遍历二叉树:";
PreOrderTraverse(T);
cout<<endl;
cout<<"中序遍历二叉树:";
InOrderTraverse(T);
cout<<endl;
cout<<"后序遍历二叉树:";
PostOrderTraverse(T);
cout<<endl;
cout << endl << "树的深度:" << BiTreeDepth(T);
cout << endl << "结点的个数:" << NodeCount(T);
cout << endl << "叶结点的个数:" << LeafCount(T);
cout << endl << "度为1的结点个数:" << Node_1_Count(T);
cout << endl << "二叉树中从每个叶子结点到根结点的所有路径:" << endl;
char path[256];
int pathlen = 0;
DblOrderTraverse(T);
cout<<endl;
}
二叉树基本操作的实现
最新推荐文章于 2024-01-03 03:09:29 发布