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

中序，先序，后序，按层遍历

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)
{
//     if (BT == NULL)
//         return;
    if (BT){
        BinTree binTree[10000];   //数组迭代存储层序遍历的节点
    int head = 0, last = 0; //
    binTree[last++] = BT;
 
    while (head < last)     //通过迭代存储和遍历节点
    {
        BinTree temp = binTree[head++];
        printf(" %c", temp->Data);
 
        if (temp->Left)     //左子树存在
            binTree[last++] = temp->Left;
        if (temp->Right)    //右子树存在
            binTree[last++] = temp->Right;
    }
    }
}