【数据结构】二叉树的(先序、中序、后序、层次)遍历方法实现

C/C++代码实现

#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define OVERFLOW -2
#define QUEUE_INIT_SIZE 100

#include <stdio.h>
#include <stdlib.h>

typedef int Status;
typedef char TElemType;

//二叉树结点数据结构
typedef struct BiTNode
{
    TElemType data;
    struct BiTNode* lchild;//左孩子指针
    struct BiTNode* rchild;//右孩子指针
} BiTNode, * BiTree;

typedef BiTree QElemType;

typedef struct
{
    QElemType* base;
    int   front;
    int   rear;
} SqQueue; //顺序表实现队列 非循环队列

Status InitQueue(SqQueue& Q)
{
    Q.base = (QElemType*)malloc(sizeof(QElemType) * QUEUE_INIT_SIZE);
    if (!Q.base) exit(OVERFLOW);
    Q.front = Q.rear = 0;
    return OK;
}

Status EnQueue(SqQueue& Q, QElemType e)
{
    Q.base[Q.rear] = e;
    Q.rear = Q.rear + 1;
    //循环队列
    //Q.rear = (Q.rear + 1)%(QUEUE_INIT_SIZE + 1);
    return OK;
}

Status DeQueue(SqQueue& Q, QElemType& e)
{
    if (Q.front == Q.rear)
    {
        return ERROR;
    }
    e = Q.base[Q.front];
    //循环队列
    //Q.front = (Q.front + 1) % (QUEUE_INIT_SIZE + 1);
    Q.front = Q.front + 1;

    return OK;
}

Status IsEmpty(SqQueue& Q)
{
    if (Q.front == Q.rear) return TRUE;
    return FALSE;
}

Status GetFront(SqQueue& Q, QElemType& e)
{
    if (Q.front == Q.rear)
        return ERROR;
    e = Q.base[Q.front];
    return OK;
}

void ClearQueue(SqQueue& Q)
{
    free(Q.base);
    Q.base = NULL;
    Q.front = Q.rear;
}

/*按照先序顺序输入二叉树中的结点值 #代表空树结点
abc##d##ef###
*/
Status CreateBiTree(BiTree& T)
{
    TElemType ch;
    scanf("%c", &ch);

    if (ch == '#')
    {
        T = NULL;
    }
    else
    {
        if ((T = (BiTNode*)malloc(sizeof(BiTNode))) == NULL)
            exit(OVERFLOW);
        T->data = ch;
        CreateBiTree(T->lchild);//创建左孩子结点
        CreateBiTree(T->rchild);//创建右孩子结点
    }
    return OK;
}

/*先序遍历二叉树*/
Status PreOrderTraverse(BiTree& T)
{
    if (T)
    {
        printf("%c ", T->data);
        if (PreOrderTraverse(T->lchild))
            if (PreOrderTraverse(T->rchild))
                return OK;
    }
    else
    {
        return OK;
    }
}

/*中序遍历二叉树*/
Status InOrderTraverse(BiTree& T)
{
    if (T)
    {
        if (InOrderTraverse(T->lchild))
        {
            printf("%c ", T->data);
            if (InOrderTraverse(T->rchild))
                return OK;
        }
    }
    else
    {
        return OK;
    }
}

/*后序遍历二叉树*/
Status PostOrderTraverse(BiTree& T)
{
    if (T)
    {
        if (PostOrderTraverse(T->lchild))
            if (PostOrderTraverse(T->rchild))
            {
                printf("%c ", T->data);
                return OK;
            }
    }
    else
    {
        return OK;
    }
}

/*层次遍历二叉树*/
void LevelOrderTraverse(BiTree& T)
{
    BiTree t;
    SqQueue Q;
    InitQueue(Q);

    if (T)
    {
        EnQueue(Q, T);
        while (!IsEmpty(Q))
        {
            GetFront(Q, t);
            printf("%c ", t->data);
            DeQueue(Q, t);
            if (t->lchild)
            {
                EnQueue(Q, t->lchild);
            }
            if (t->rchild)
            {
                EnQueue(Q, t->rchild);
            }
        }
    }

    ClearQueue(Q);
}

/*输出二叉树树形*/
void ShapeBiTree(BiTree &T,int depth)
{
    if (T)
    {
        ShapeBiTree(T->rchild, depth + 1);
        for (int i = 1; i < depth; i++)
            printf("     ");
        printf("%c\n", T->data);
        ShapeBiTree(T->lchild, depth + 1);
    }
}

/*销毁树结点*/
void DestroyBiTree(BiTree &T)
{
    if (T)
    {
        if (T->lchild)
            DestroyBiTree(T->lchild);
        if (T->rchild)
            DestroyBiTree(T->rchild);
        //delete T;
        free(T);
        T = NULL;
    }
}


int main()
{
    BiTree T;
    CreateBiTree(T);
    printf("先序：");
    PreOrderTraverse(T);
    printf("\n");
    printf("中序：");
    InOrderTraverse(T);
    printf("\n");
    printf("后序：");
    PostOrderTraverse(T);
    printf("\n");
    printf("层次：");
    LevelOrderTraverse(T);
    printf("\n");
    ShapeBiTree(T, 1);

    DestroyBiTree(T);

    return 0;
}