由于编者时间以及水平有限,如有错误,敬请斧正 ʘᴗʘ、
#include <stdio.h>
#include <stdlib.h>
#include<malloc.h>
#define MAXSIZE 100
typedef struct BiTNode
{
char data;
struct BiTNode *lchild;
struct BiTNode *rchild;
} BiTNode,*BiTree;
void CreateBiTree(BiTree *T)//BiTNode **T//先序遍历建立二叉树
{
char x;
scanf(" %c",&x);/*请注意,须在%c前加空格,以此吸收缓冲区的回车'*/
if(x=='#')
*T=NULL;///需要对指针T赋空,因此要用二级指针修改指针T的地址为NULL
else
{
*T=(BiTree)malloc(sizeof(BiTNode));
(*T)->data=x;
printf("请输入%c的左子树: ",x);
CreateBiTree(&(*T)->lchild);
printf("请输入%c的右子树: ",x);
CreateBiTree(&(*T)->rchild);
}
}
void PreOrderTraverse(BiTree T)//先序遍历
{
if(T)
{
printf("根节点:%c ",T->data);
PreOrderTraverse(T->lchild);
PreOrderTraverse(T->rchild);
}
}
typedef struct//定义栈
{
BiTree base;
int top;
} SqStack;
void InitStack(SqStack* S)
{
S->base = (BiTree)malloc(sizeof(BiTNode) * MAXSIZE);
S->top = -1;
}
void Push(SqStack* S,BiTree T)//入栈
{
if (S->top == MAXSIZE-1)
{
printf("栈满了");
return;
}
S->top++;
S->base[S->top] = *T;
}
void Pop(SqStack* S,BiTree T)//出栈
{
if (S->top == -1)
{
printf("栈空了");
return;
}
*T=S->base[S->top];
S->top--;
}
void InOrderTraverse_non_recursive(BiTree T)//利用栈中序遍历非递归
{
BiTree p,q;
SqStack S;
InitStack(&S);
p=T;
q=(BiTree)malloc(sizeof(BiTNode));
while(p||S.top!=-1)
{
if(p)
{
Push(&S,p);
p=p->lchild;
}
else
{
Pop(&S,q);
printf("根节点:%c ",q->data);
p=q->rchild;
}
}
}
void InOrderTraverse(BiTree T)//中序遍历
{
if(T)
{
InOrderTraverse(T->lchild);
printf("根节点:%c ",T->data);
InOrderTraverse(T->rchild);
}
}
void PostOrderTraverse(BiTree T)
{
if(T)
{
PostOrderTraverse(T->lchild);
PostOrderTraverse(T->rchild);
printf("根节点:%c ",T->data);
}
}
int LeafCount(BiTree T)//统计叶子节点个数
{
if(T==NULL)
return 0;
if(T->lchild==NULL&&T->rchild==NULL)
return 1;
else
return LeafCount(T->lchild)+LeafCount(T->rchild);
}
int main()
{
int num;
BiTree T;
// CreateBiTree(&T);
// PreOrderTraverse(T);
// InOrderTraverse(T);
// InOrderTraverse_non_recursive(T);
// num=LeafCount(T);
// printf("叶子节点个数:%d",num);
int input;
do
{
printf("\n\n\n\n");
printf("\t\t|-------------------------------------------------------------|\n");
printf("\t\t| |\n");
printf("\t\t| ====================== |\n");
printf("\t\t| |\n");
printf("\t\t| 1.先序建立二叉树 |\n");
printf("\t\t| 2.先序遍历 |\n");
printf("\t\t| 3.中序遍历 |\n");
printf("\t\t| 4.中序遍历非递归 |\n");
printf("\t\t| 5.后序遍历 |\n");
printf("\t\t| 6.统计叶子节点个数 |\n");
printf("\t\t| 7.退出系统 |\n");
printf("\t\t|-------------------------------------------------------------|\n");
printf("\n\t\t请输入您的选择:");
scanf("%d", &input);
switch (input)
{
case 1:
CreateBiTree(&T);
break;
case 2:
PreOrderTraverse(T);
break;
case 3:
InOrderTraverse(T);
break;
case 4:
InOrderTraverse_non_recursive(T);
break;
case 5:
PostOrderTraverse(T);
break;
case 6:
printf("叶子节点个数:%d",num=LeafCount(T));
break;
case 7:
printf("退出成功");
break;
default:
printf("选择有误,请重新选择");
break;
}
} while (input != 7);
return 0;
}