二叉树的构建及遍历

# include <stdio.h>
# include <stdlib.h>
typedef char DataType;


typedef struct Node 
{
DataType data;
struct Node *LChild;
struct Node *RChild;
}BiTNode, *BiTree;
int LeafCount = 0;
int nLayer = 4;
void CreateBiTree(BiTree *bt)           //建链表
{
char ch;
ch = getchar();
if (ch == '.')
*bt = NULL;
else
{
*bt = (BiTree)malloc(sizeof(BiTNode));
(*bt)->data  = ch;
    CreateBiTree(&((*bt)->LChild ));
CreateBiTree(&((*bt)->RChild ));
}


}
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;
}
void PreOrder(BiTree root )     //先序比例输出二叉树叶节点
{
if (root != NULL)
{
if (root->LChild == NULL && root->RChild == NULL)
printf("%c ", root->data );
PreOrder(root->LChild );
PreOrder(root->RChild );
}
}
void Leaf (BiTree root )        //后序遍历统计叶子节点数目
{
if (root != NULL)
{
Leaf(root->LChild );
Leaf(root->RChild );
if (root ->LChild == NULL && root->RChild == NULL)
LeafCount++;
}
}
void POrder(BiTree root)   //中序遍历输出二叉树的节点
{
if (root != NULL)
{
POrder(root->LChild );
printf("%c ", root->data );
POrder(root->RChild );
}
}
void InOrder(BiTree root)
{
if (root != NULL)
{
InOrder(root->LChild );
InOrder(root->RChild );
printf("%c ", root->data );
}
}
void PrintTree(BiTree bt, int nLayer)    //按树状打印二叉树
{
if (bt == NULL)
return ;
PrintTree(bt->RChild , nLayer+1);
for (int i = 1; i < nLayer; i++)
printf(" ");
printf("%c\n", bt->data );
PrintTree(bt->LChild ,nLayer + 1);
}
int main(void)
{
BiTree root;
printf("以先序遍历序列创建二叉树\n");
CreateBiTree(&root);
printf("\n中序遍历输出二叉树的节点\n");
POrder(root);
printf("\n后续遍历输出二叉树的节点\n");
InOrder(root);
printf("\n先序比例输出二叉树叶节点\n");
PreOrder(root);
printf("\n后序遍历统计叶子节点数目\n");
Leaf(root);
printf("%d\n", LeafCount);
printf("按树状打印二叉树\n");
PrintTree(root,nLayer);


return 0;
}