6-9 二叉树的遍历 (25 分)

void InorderTraversal( BinTree BT ){
    if(!BT) return ;
    InorderTraversal(BT->Left);
    printf(" %c",BT->Data);
    InorderTraversal(BT->Right);
}
void PreorderTraversal( BinTree BT ){
     if(!BT) return ;
    printf(" %c",BT->Data);
    PreorderTraversal(BT->Left);
    PreorderTraversal(BT->Right);
}
void PostorderTraversal( BinTree BT ){
     if(!BT) return ;
    PostorderTraversal(BT->Left);
    PostorderTraversal(BT->Right);
    printf(" %c",BT->Data);
}
void LevelorderTraversal( BinTree BT ){
    if(!BT) return ;
    BinTree a[10];
    BinTree b=NULL;
    int l=0,r=0;
    a[r]=BT;
    r = (r+1)%10;
    while(r!=l){
        b=a[l];
        l = (l+1)%10;
        printf(" %c",b->Data);
        if(b->Left){
            a[r]=b->Left; 
            r = (r+1)%10;
        } 
        if(b->Right){
            a[r]=b->Right;
            r = (r+1)%10;
        } 
         
        
    }
}