#include <stdio.h>
#include <stdlib.h>
//二叉树的二叉链表结点结构
typedef struct Node
{
char data;
struct Node*LChild;
struct Node*RChild;
}BiTNode,*BiTree;
//扩展先序遍历序列创建二叉链表
void CreateBiTree(BiTree * bt)
{
char ch = getchar();
if(ch=='.')
*bt=NULL;
else
{
(*bt)=(BiTree)malloc(sizeof(BiTNode));
(*bt)->data=ch;
CreateBiTree( & ((*bt)->LChild));
CreateBiTree( & ((*bt)->RChild));
}
}
//先序遍历二叉树
void PreOrder(BiTree root)
{
if(root!=NULL)
{
printf("%c",root->data);
PreOrder(root->LChild);
PreOrder(root->RChild);
}
}
//中序遍历二叉树
void InOrder(BiTree root)
{
if(root!=NULL)
{
InOrder(root->LChild);
printf("%c",root->data);
InOrder(root->RChild);
}
}
//后序遍历二叉树
void PostOrder(BiTree root)
{
if(root!=NULL)
{
PostOrder(root->LChild);
PostOrder(root->RChild);
printf("%c",root->data);
}
}
//先序遍历输出二叉树中的叶子结点
void YPreOrder(BiTree root)
{
if(root!=NULL)
{
if(root->LChild==NULL&&root->RChild==NULL)
printf("%c",root->data);
PreOrder(root->LChild);
PreOrder(root->RChild);
}
}
//后序遍历统计叶子结点数目
int leaf(BiTree root)
{
int LeafCount;
if(root==NULL)
LeafCount =0;
else if ((root->LChild==NULL)&&(root->RChild==NULL))
LeafCount =1;
else
LeafCount =leaf(root->LChild)+leaf(root->RChild);
return LeafCount;
}
//后序遍历二叉树高度的递归算法
int PostTreeDepth(BiTree bt)
{
int hl, hr, max;
if(bt!=NULL)
{
hl=PostTreeDepth(bt->LChild);
hr=PostTreeDepth(bt->RChild);
max=hl>hr?hl:hr;
return(max+1);
}
else return(0);
}
int main()
{
printf("ÇëÊäÈ룺");
int Case=10;
while (Case--)
{
BiTree tree;
CreateBiTree(&tree);
printf("\n\nPreOrder:\n\n");
PreOrder(tree);
printf("\n\nInOrder:\n\n");
InOrder(tree);
printf("\n\nPostOrder:\n\n");
PostOrder(tree);
printf("\n\nYPreOrder:\n\n");
YPreOrder(tree);
printf("\nLeafCount:%d\n",leaf(tree));
printf("\nPostTreeDepth:%d\n",PostTreeDepth(tree));
char ch = getchar();
}
return 0;
}