二叉树的四种遍历方式：代码

Acaibird.

于 2022-10-31 21:51:37 发布

阅读量207

点赞数

文章标签： c++ 算法数据结构

原文链接：https://blog.csdn.net/qq_45922628/article/details/107872626?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522166722322616782390519051%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fall.%2522%257D&request_id=166722322616782390519051&biz_i

版权

//中序遍历
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)
    {
        int i=0,j=0;
        BinTree p[100];
        i=j=0;
        p[i++]=BT;
        while(j<i)
        {
            printf(" %c",p[j]->Data);
            if(p[j]->Left)
                p[i++]=p[j]->Left;
            if(p[j]->Right)
                p[i++]=p[j]->Right;
            j++;
        }
    }
}