本题要求给定二叉树的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){
if(BT->Left) InorderTraversal(BT->Left);
printf(" %c",BT->Data);
if(BT->Right) InorderTraversal(BT->Right);
}
}
void PreorderTraversal( BinTree BT ){ //先
if(BT!=NULL){
printf(" %c",BT->Data);
if(BT->Left) PreorderTraversal(BT->Left);
if(BT->Right) PreorderTraversal(BT->Right);
}
}
void PostorderTraversal( BinTree BT ){ //后
if(BT!=NULL){
if(BT->Left) PostorderTraversal(BT->Left);
if(BT->Right) PostorderTraversal(BT->Right);
printf(" %c",BT->Data);
}
}
void LevelorderTraversal( BinTree BT ){
BinTree a[100];
BinTree t;
int front=0,rear=0;
if(BT!=NULL){
//rear=(rear+1)%100;
a[rear++]=BT;
while(rear!=front){
t=a[front++];
printf(" %c",t->Data);
if(t->Left) a[rear++]=t->Left;
if(t->Right) a[rear++]=t->Right;
}
}
}