/树子系统/
#include <stdio.h>
#include <malloc.h>
#define MAX 100
int count=0; /定义计算结点个数的变量/
typedef struct tnode
{
char data;
struct tnode *lchild,*rchild;
}*BiTree,tnode;
void pre_order_traveral_brackets1(BiTree t);
void BiTreecreate(BiTree *bt)
{
char ch;
char pch[]=“ABD
E
H
J
EHJ
EHJKLKaTeX parse error: Can't use function '$' in math mode at position 2: M$̲N
C
F
CF
CF
G
G
GI$
"
;
s
t
a
t
i
c
i
n
t
i
=
0
;
c
h
=
p
c
h
[
i
+
+
]
;
i
f
(
c
h
=
=
′
"; static int i=0; ch=pch[i++]; if(ch=='
";staticinti=0;ch=pch[i++];if(ch==′’) *bt=NULL;
else
{
*bt=(BiTree)malloc(sizeof(tnode));
(*bt)->data=ch;
BiTreecreate(&((*bt)->lchild));
BiTreecreate(&((*bt)->rchild));
}
}
int flag=1;
void ShowBTree(BiTree t) /用广义表表示法显示二叉树/
{ if(t!=NULL)
{
printf(”(");
printf("%c",t->data);
ShowBTree(t->lchild);
if(t->rchild)
{
printf(",");
pre_order_traveral_brackets1(t->rchild);
printf(")");
}
}
}
void pre_order_traveral_brackets1(BiTree t)
{ if(t!=NULL)
{
printf("%c",t->data);
ShowBTree(t->lchild);
if(t->rchild)
{
printf(",");
pre_order_traveral_brackets1(t->rchild);
}
printf(")");
}
}
void pre_order_traveral(BiTree t) /* 先序遍历二叉树T*/
{ if(t)
{
printf("%c ",t->data);
pre_order_traveral(t->lchild);
pre_order_traveral(t->rchild);
}
}
void zhongorder_traveral(BiTree t)
{
if(t)
{
pre_order_traveral(t->lchild);printf("%c ",t->data);
pre_order_traveral(t->rchild);
}
}
void houorder_traveral(BiTree t)
{
if(t)
{
pre_order_traveral(t->lchild);
pre_order_traveral(t->rchild);printf("%c ",t->data);
}
}
void cengxu(BiTree t)
{
BiTree Q[100],p;
int front, rear;
front = rear = 0;
if (!t)return;
Q[rear++] = t;
while (front != rear)
{
p = Q[front++];
if (p->lchild)Q[rear++] = p->lchild;
if (p->rchild)Q[rear++] = p->rchild;
printf(" %c", p->data);
}
}
int zhongjiedian(BiTree t)
{
if (t)
{
return (zhongjiedian( t->lchild) + zhongjiedian( t->rchild)) + 1;
}
else
{
return 0;
}
}
int yezhi(BiTree *t,int count)
{
if((*t)!=NULL)
{
if((*t)->lchildNULL&&(*t)->rchildNULL)
count++;
count=yezhi(&(*t)->lchild,count);
count=yezhi(&(*t)->rchild,count);
}
return count;
}
int max(int a,int b)
{
return a>b?a:b;
}
int BiTreedeep(BiTree t)
{
if(tNULL)
return 0;
else
{
if(t->lchildNULL&&t->rchild==NULL)
return 1;
else
return 1+max(BiTreedeep(t->lchild),BiTreedeep(t->rchild));
}
}
void MenuTree() /显示菜单子函数/
{
printf("\n 二叉树子系统");
printf("\n =================================================");
printf("\n| 1——建立一个新二叉树 |");
printf("\n| 2——广义表表示法显示 |");
printf("\n| 3——先序遍历 |");
printf("\n| 4——中序遍历 |");
printf("\n| 5——后序遍历 |");
printf("\n| 6——层次遍历 |");
printf("\n| 7——求叶子结点数目 |");
printf("\n| 8——求二叉树总结点数目 |");
printf("\n| 9——求树深度 |");
printf("\n| 0——返回 |");
printf("\n ================================================");
printf("\n请输入菜单号(0-9)😊;
}
int main()
{ BiTree t=NULL;
char ch1,ch2,a;
ch1=‘y’;
while(ch1==‘y’||ch1==‘Y’)
{ MenuTree();
scanf("%c",&ch2);
getchar();
switch(ch2)
{
case ‘1’:
BiTreecreate(&t);
printf("二叉树成功建立!");break;
case '2':
printf("二叉树广义表表示法如下:");
ShowBTree(t);break;
case '3':
printf("二叉树的先序遍历序列为:");
pre_order_traveral(t);break;
case '4':
printf("二叉树的中序遍历序列为:");
zhongorder_traveral(t);break;
case '5':
printf("二叉树的后序遍历序列为:");
houorder_traveral(t);break;
case '6':
printf("二叉树的层次遍历序列为:");
cengxu(t);break;
case '7':
printf("该二叉树有%d个叶子。",yezhi(&t,count));break;
case '8':
count=0;
printf("该二叉树共有%d个结点。",zhongjiedian(t));break;
case '9':
printf("该二叉树的深度是%d。",BiTreedeep(t));break;
case '0':
ch1='n';break;
default:
printf("输入有误,请输入0-9进行选择!");
}
if(ch2!='0')
{ printf("\n按回车键继续,按任意键返回主菜单!\n");
a=getchar();
if(a!='\xA')
{
getchar();ch1='n';
}
}
}
}