二叉樹的完整代碼實現

#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
    
typedef struct Node//結構體  
{
    char data;
    struct Node *LChild;
    struct Node *RChild;
} BinNode,*BinTree;

BinTree CreateTree(BinTree T)
{
    char ch;
    scanf("%c",&ch);
    if(ch=='#')
        return NULL;
    else
    {
        T=(BinTree)malloc(sizeof(BinNode));
        T->data=ch;
        T->LChild=CreateTree(T->LChild);/*創建左子樹*/
        T->RChild=CreateTree(T->RChild);/*創建右子樹*/
        return T;
    }
}

void PreOrder(BinTree root)//先序遍歷 
{
    if (root != NULL)
    {
        printf("%c", root->data);
        PreOrder(root->LChild);
        PreOrder(root->RChild);
    }
}

void InOrder(BinTree root)//中序遍歷 
{
    if (root != NULL)
    {
        InOrder(root->LChild);
        printf("%c", root->data);
        InOrder(root->RChild);
    }
}

void PostOrder(BinTree root)//后序遍歷 
{
    if (root != NULL)
    {
        PostOrder(root->LChild);
        PostOrder(root->RChild);
        printf("%c", root->data);
    }
}
/*求二叉樹結點總數*/
int Count(BinTree T)
{
    if(T==NULL)
        return 0;                   /*空二叉樹結點數為0*/
    else                            /*左右子樹結點總數加1*/
        return Count(T->LChild)+Count(T->RChild)+1;
}
//葉子數 
int LeafCount(BinTree T){
    if(T == NULL){
        return 0;
    }
    else if ((T->LChild==NULL) && (T->RChild==NULL)){
        return 1;
    }
    else{
        return LeafCount(T->LChild)+LeafCount(T->RChild);
    }
}
int main()
{

    BinTree bt;
    printf("一、請按先序的方式輸入二叉樹的結點元素（注：輸入#表示節點為空）如:ABC##DE#G##F###\n");
    bt=CreateTree(bt);
    printf("二、前序遍歷二叉樹：\n");
    PreOrder(bt);
    printf("\n");
    printf("三、中序遍歷二叉樹：\n");
    InOrder(bt);
    printf("\n");
    printf("四、后序遍歷二叉樹：\n");
    PostOrder(bt);
    printf("\n");
    printf("五、二叉樹結點數: %d\n",Count(bt));
    printf("六、葉子節點的個數：%d \n",LeafCount(bt));
    system("pause");
}