树的遍历

void InorderTraversal( BinTree BT )//中序遍历
{
    if(BT)
    {
        InorderTraversal(BT->left);
        printf("%c",BT->Data);
        InorderTraversal(BT->right);
    }
}
void PreorderTraversal( BinTree BT )//先序遍历
{
    if(BT)
    {
        printf("%c",BT->Data);
        PreorderTraversal(BT->left);
        PreorderTraversal(BT->right);
        
    }
}
void PostorderTraversal( BinTree BT )//后序遍历
{
    if(BT)
    {
    PostorderTraversal(BT->left);
    PostorderTraversal(BT->right);
    printf("%c",BT->Data);
    }
 
}
void LevelorderTraversal( BinTree BT )//层次遍历
{
    Bintree p[100];
    int i=0;
    int j=0;
    p[0]=BT;
    while(BT)
    {
        if(BT->Left=！=NULL)
        {
            p[++i]=BT->Left;
        }
        if(BT->right！=NULL)
        {
            p[++i]=BT->right;
        }
        Bintree q=p[j];
        printf(q->data);
        if(i==j)
            break;
        j++;
        BT=p[j];
    }
}