数据结构-3 二叉树的遍历

来源：互联网发布：javaweb项目知乎编辑：程序博客网时间：2024/06/09 21:45
#include<stdio.h>typedef int ElementType;// 二叉树链式存储的数据结构typedef struct TNode *Position;typedef Position BinTree;struct TNode {    ElementType Data;    BinTree Left;    BinTree Right;};// 前序遍历的递归实现void PreorderTraversal1(BinTree BT) {    if (BT) {        printf("%d", BT->Data);         PreorderTraversal(BT->Left);        PreorderTraversal(BT->Right);    }}// 前序遍历的堆栈实现void PreorderTraversal2(BinTree BT) {    BinTree T = BT;    Stack S = CreateStack(MaxSize);    while (T || !isEmpty(S)) {        while (T) {            Push(S, T);            printf("%d", T->Data);            T = T->Left;        }        if (!isEmpty(S)) {            T = Pop(S);            T = T->Right;        }    }}// 中序遍历的递归实现void InorderTraversal1(BinTree BT) {    if (BT) {        PreorderTraversal(BT->Left);        printf("%d", BT->Data);         PreorderTraversal(BT->Right);    }}// 中序遍历的堆栈实现void InorderTraversal2(BinTree BT) {    BinTree T = BT;    Stack S = CreateStack(MaxSize);    while (T || !isEmpty(S)) {        while (T) {            Push(S, T);            T = T->Left;        }        if (!isEmpty(S)) {            T = Pop(S);            printf("%d", T->Data);            T = T->Right;        }    }}// 后序遍历的递归实现void PostorderTraversal1(BinTree BT) {    if (BT) {        PreorderTraversal(BT->Left);        PreorderTraversal(BT->Right);        printf("%d", BT->Data);     }}// 后序遍历的堆栈实现// 层次遍历的队列实现void LevelorderTraversal(BinTree BT) {      BinTree TP;    if (!BT)    return;    Queue Q = CreateQueue();    AddQuene(Q, BT);    // 将根节点入队    while (isEmpty(Q)) {        TP = DeleteQueue(Q);        printf("%d ", TP->Data);        if (TP->Left)   AddQuene(Q, TP->Left);        if (TP->Right)  AddQuene(Q, TP->Right);    }}
阅读全文
0 0