二叉树的简单操作

实现二叉树的基本操作：初始化、创建二叉树、判别二叉树是否为空、3种遍历的递归算法、统计创建的二叉树的结点和叶子结点的个数、求二叉树的深度。

#include <stdio.h>
#include <stdlib.h>

/**
 *ziyif
 */

typedef char TElemType;
typedef struct BiTNode{
    TElemType data;
    struct BiTNode *lchild, *rchild;
}BiTNode,*BiTree;


void CreateBiTree(BiTNode **T);
void PreOrderTraverseR(BiTNode *T);
void InOrderTraverseR(BiTNode *T);
void PostOrderTraverseR(BiTNode *T);
//void PreOrderTraverse(BiTNode *T);
//void InOrderTraverse(BiTNode *T);
int Depth(BiTNode *T);
int NodeCount(BiTNode *T);
int LeafCount(BiTNode *T);
TElemType Leaf(BiTNode *T);

int main()
{
    BiTNode *T;
    T=(BiTNode*)malloc(sizeof(BiTNode));
    CreateBiTree(&T);
    printf("preorder(recursive): ");
    PreOrderTraverseR(T);
    printf("\n");
    printf("inorder(recursive): ");
    InOrderTraverseR(T);
    printf("\n");
    printf("postorder(recursive): ");
    PostOrderTraverseR(T);
    printf("\n");
    printf("preorder(non-recursive): ");
    PreOrderTraverseR(T);
    printf("\n");
    printf("inorder(non-recursive): ");
    InOrderTraverseR(T);
    printf("\n");
    printf("the number of nodes: %d\n",NodeCount(T));
    printf("leaf nodes: ");
    Leaf(T);
    printf("\n");
    printf("the number of leaf nodes: %d\n",LeafCount(T));
    printf("the depth of the binary tree: %d\n",Depth(T));
    return 0;
}


void CreateBiTree(BiTNode **T){
    TElemType ch;
    scanf("%c",&ch);
    if(ch=='#'){
        *T=NULL;
    }
    else{
        *T=(BiTNode*)malloc(sizeof(BiTNode));
        if(!(*T)){
            printf("OVERFLOW");
            exit(0);
        }
        (*T)->data=ch;
        CreateBiTree(&(*T)->lchild);
        CreateBiTree(&(*T)->rchild);
    }

}

void PreOrderTraverseR(BiTNode *T){
    if(T){
        printf("%c",T->data);
        PreOrderTraverseR(T->lchild);
        PreOrderTraverseR(T->rchild);
    }
}

void InOrderTraverseR(BiTNode *T){
    if(T){
        InOrderTraverseR(T->lchild);
        printf("%c",T->data);
        InOrderTraverseR(T->rchild);
    }
}

void  PostOrderTraverseR(BiTNode *T){
    if(T){
        PostOrderTraverseR(T->lchild);
        PostOrderTraverseR(T->rchild);
        printf("%c",T->data);
    }
}

/*void PreOrderTraverse(BiTNode T){

}

void InOrderTraverse(BiTNode T){

}*/

int Depth(BiTNode *T){
    if(!T){
        return 0;
    }
    else{
        int m = Depth(T->lchild);
        int n = Depth(T->rchild);
        return m>n?m+1:n+1;
    }
}

int NodeCount(BiTNode *T){
    if(!T){
        return 0;
    }
    else{
        return NodeCount(T->lchild)+NodeCount(T->rchild)+1;
    }
}

int LeafCount(BiTNode *T){
    if(!T){
        return 0;
    }
    if(!T->lchild&&!T->rchild){
        return 1;
    }
    else{
        return LeafCount(T->lchild)+LeafCount(T->rchild);
    }
}

TElemType Leaf(BiTNode *T){
    if(T)
    {
        if(T->lchild==NULL&&T->rchild==NULL){
            printf("%c ",T->data);
        }
        Leaf(T->lchild);
        Leaf(T->rchild);
    }
}