二叉树的遍历

#include<stdio.h>
#define ElemType int
typedef struct BiTNode
{
    ElemType data;
    struct BiTNode *lchild, *rchild;

}BiTNode,*BiTree;

void PreOrder(BiTree bt)//先序遍历二叉树 
{
    if(bt!=NULL)
    {
        printf("%d",bt->data);
        PreOrder(bt->lchild);
        PreOrder(bt->rchild);
    }
}
void InOrder(BiTree bt)//中序遍历二叉树  
{
    if(bt!=NULL)
    {

        InOrder(bt->lchild);
        printf("%d",bt->data);
        InOrder(bt->rchild);
    }
}
void PostOrder(BiTree bt)//后序遍历二叉树 
{
    if(bt!=NULL)
    {

        PostOrder(bt->lchild);
        PostOrder(bt->rchild);
        printf("%d",bt->data);
    }
}