6-9 二叉树的遍历 (25 分)
本题要求给定二叉树的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;
BinTree f[10000];
int t = -1;
while (BT != NULL || t>-1) {
while (BT != NULL) {
f[++t] = BT;
BT = BT->Left;
}
if (t > -1) {
BT = f[t--];
printf(" %c", BT->Data);
BT = BT->Right;
}
}
return;
}
void PreorderTraversal(BinTree BT) {
if (BT == NULL) return;
BinTree f[10000];
int t = -1;
while (BT != NULL || t>-1) {
while (BT != NULL) {
printf(" %c", BT->Data);
f[++t] = BT;
BT = BT->Left;
}
if (t > -1) {
BT = f[t--];
BT = BT->Right;
}
}
return;
}
void PostorderTraversal(BinTree BT) {
if (BT == NULL) return;
BinTree f[10000];
BinTree pre=NULL, cur;
int t = -1;
f[++t] = BT;
while (t>-1) {
cur = f[t];
if(cur->Left == NULL&&cur->Right == NULL || (pre != NULL && (cur->Left == pre || cur->Right == pre))) {
printf(" %c",cur->Data);
t--;
pre = cur;
}
else {
if (cur->Right != NULL)
f[++t] = cur->Right;
if (cur->Left != NULL)
f[++t] = cur->Left;
}
}
return;
}
void LevelorderTraversal(BinTree BT) {
if (BT == NULL) return;
BinTree f[100000] = {NULL};
f[0] = BT;
int i = 0,t=0;
while (f[i]!=NULL) {
if (f[i]->Left != NULL) f[++t] = f[i]->Left;
if (f[i]->Right != NULL) f[++t] = f[i]->Right;
i++;
}
for (int j = 0; j <= t; j++)
printf(" %c", f[j]->Data);
return;
}