本题要求给定二叉树的4种遍历。
函数接口定义:
void InorderTraversal( BinTree BT );
void PreorderTraversal( BinTree BT );
void PostorderTraversal( BinTree BT );
void LevelorderTraversal( BinTree BT );
其中BinTree结构定义如下:
typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
ElementType Data;
BinTree Left;
BinTree Right;
};
要求4个函数分别按照访问顺序打印出结点的内容,格式为一个空格跟着一个字符。
裁判测试程序样例:
#include <stdio.h>
#include <stdlib.h>
typedef char ElementType;
typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
ElementType Data;
BinTree Left;
BinTree Right;
};
BinTree CreatBinTree(); /* 实现细节忽略 */
void InorderTraversal( BinTree BT );
void PreorderTraversal( BinTree BT );
void PostorderTraversal( BinTree BT );
void LevelorderTraversal( BinTree BT );
int main()
{
BinTree BT = CreatBinTree();
printf(“Inorder:”); InorderTraversal(BT); printf("\n");
printf(“Preorder:”); PreorderTraversal(BT); printf("\n");
printf(“Postorder:”); PostorderTraversal(BT); printf("\n");
printf(“Levelorder:”); LevelorderTraversal(BT); printf("\n");
return 0;
}
/* 你的代码将被嵌在这里 */
输出样例(对于图中给出的树):
Inorder: D B E F A G H C I
Preorder: A B D F E C G H I
Postorder: D E F B H G I C A
Levelorder: A B C D F G I E H
void InorderTraversal( BinTree BT )
{
if(BT == NULL)
return;
else
{
InorderTraversal( BT->Left);
printf(" %c", BT->Data);
InorderTraversal( BT->Right);
}
}
void PreorderTraversal( BinTree BT )
{
if(BT == NULL)
return;
else
{
printf(" %c", BT->Data);
PreorderTraversal( BT->Left);
PreorderTraversal( BT->Right);
}
}
void PostorderTraversal( BinTree BT )
{
if(BT == NULL)
return;
else
{
PostorderTraversal( BT->Left);
PostorderTraversal( BT->Right);
printf(" %c", BT->Data);
}
}
#define MAXSIZE 100000
typedef struct
{
BinTree base[MAXSIZE];
int front;
int rear;
}SqQueue;
void InitQueue(SqQueue *q)
{
q->front = 0;
q->rear = 0;
}
int EnQueue(SqQueue *q, BinTree bt)
{
if(q->rear == MAXSIZE -1) return 0;
q->base[q->rear] = bt;
// printf("%c",data);
// q->rear = (q->rear +1)%MAXSIZE;
q->rear++;
return 1;
}
int DeQueue(SqQueue *q,BinTree bt)
{
if(q->rear == q->front)
return 0;
else
{
bt->Data = q->base[q->front]->Data;
bt->Left = q->base[q->front]->Left;
bt->Right = q->base[q->front]->Right;
q->front++;
return 1;
}
}
int Empty(SqQueue q)
{
if(q.rear == q.front) return 1;
return 0;
}
void LevelorderTraversal( BinTree BT )
{
if(BT == NULL)
;
else
{
SqQueue q ;
SqQueue *p = &q;
InitQueue(p);
EnQueue(p,BT);
while(p->front != p->rear)
{
struct TNode rt;
BinTree root = &rt;
DeQueue(p,root);
printf(" %c",root->Data);
if(root->Left)
EnQueue(p,root->Left);
if(root->Right)
EnQueue(p,root->Right);
}
}
}
- 注意空树(即BT==NULL)的情况