T是一個二叉樹,函數CreateBiTree(BiTree &T)是創建一顆二叉樹(使用數據結構書上的方式),函數PreOrder(BiTree &T)是輸出樹的先序遍歷,函數InOrder(BiTree &T)是輸出樹的中序遍歷,函數PostOrder(BiTree &T)是輸出樹的後序遍歷,函數LevelOrder(BiTree &T)是輸出樹的層序遍歷。數據保證合法。
函數接口定義:
void CreateBiTree(BiTree &T);
void PreOrder(BiTree &T);
void InOrder(BiTree &T);
void PostOrder(BiTree &T);
void LevelOrder(BiTree &T);
其中 T 是二叉樹。
裁判測試程序樣例:
#include <stdio.h>
#include <stdlib.h>
#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef int Status;
typedef char TElemType;
typedef struct BiTNode {
TElemType data;
struct BiTNode *lchild;
struct BiTNode *rchild;
}BiTNode, *BiTree;
/////////////////////////////////
typedef BiTNode * QElemType;
typedef struct QNode {
QElemType data;
struct QNode * next;
}QNode, *QueuePtr;
typedef struct {
QueuePtr front;
QueuePtr rear;
}LinkQueue;
Status InitQueue_L(LinkQueue &Q) {
Q.front = (QueuePtr) malloc (sizeof(QNode));
if (Q.front == NULL)
return OVERFLOW;
Q.front->next = NULL;
Q.rear = Q.front;
return OK;
}
bool QueueEmpty_L(LinkQueue &Q) {
return (Q.front == Q.rear);
}
int QueueLength_L(LinkQueue &Q) {
int count = 0;
for (QNode *p = Q.front->next; p != NULL; p = p->next)
count++;
return count;
}
Status EnQueue_L(LinkQueue &Q, QElemType e) {
QNode *s = (QNode *) malloc (sizeof(QNode));
s->data = e;
s->next = NULL;
Q.rear->next = s;
Q.rear = s;
return OK;
}
Status DeQueue_L(LinkQueue &Q) {
QNode *q = Q.front->next;
Q.front->next = q->next;
if (q->next == NULL)
Q.rear = Q.front;
free(q);
return OK;
}
void PrintQueue_L(LinkQueue &Q) {
for (QNode *p = Q.front->next; p != NULL; p = p->next)
printf("%c", p->data->data);
printf("\n");
}
/////////////////////////////////
void CreateBiTree(BiTree &T);
void PreOrder(BiTree &T);
void InOrder(BiTree &T);
void PostOrder(BiTree &T);
void LevelOrder(BiTree &T);
int main() {
BiTree T;
CreateBiTree(T);
printf("PreOrder:");
PreOrder(T);
printf("\n");
printf("InOrder:");
InOrder(T);
printf("\n");
printf("PostOrder:");
PostOrder(T);
printf("\n");
printf("LevelOrder:");
LevelOrder(T);
printf("\n");
return 0;
}
/* 你的代碼將被嵌在這裏 */
輸入格式:
按照數據結構樹上的建圖方式,給出建樹的字符串
輸出格式:
依次輸出樹的先序遍歷,中序遍歷,後序遍歷和層序遍歷
輸入樣例:
ab#c##d##
輸出樣例:
PreOrder:abcd
InOrder:bcad
PostOrder:cbda
LevelOrder:abdc
題目判定
#include <stack>
#include <queue>
using namespace std;
void CreateBiTree(BiTree &T)
{
char data;
data = getchar();
if(data == '#')
{
T = NULL;
}
else
{
T=(BiTNode *)malloc(sizeof(struct BiTNode));
T->data = data;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
}
void PreOrder(BiTree &T)
{
if(T)
{
printf("%c",T->data);
PreOrder(T->lchild);//遍歷左子樹
PreOrder(T->rchild);//遍歷右子樹
}
}
void InOrder(BiTree &T)
{
if(T)
{
InOrder(T->lchild);//遍歷左子樹
printf("%c",T->data);//輸出根節點值
InOrder(T->rchild);//遍歷右子樹
}
}
void PostOrder(BiTree &T)
{
if(T)
{
PostOrder(T->lchild);//遍歷左子樹
PostOrder(T->rchild);//遍歷右子樹
printf("%c",T->data);//輸出根節點值
}
}
void LevelOrder(BiTree &T)
{
if (!T)
{
return;
}
queue<BiTree> TreeQueue;
TreeQueue.push(T);
BiTree p = T;
while (!TreeQueue.empty())
{
p = TreeQueue.front();
TreeQueue.pop();
printf("%c", p->data);
if (p->lchild)
{
TreeQueue.push(p->lchild);
}
if (p->rchild)
{
TreeQueue.push(p->rchild);
}
}
}
完整代碼
#include <stdio.h>
#include <stdlib.h>
#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef int Status;
typedef char TElemType;
typedef struct BiTNode {
TElemType data;
struct BiTNode *lchild;
struct BiTNode *rchild;
}BiTNode, *BiTree;
/////////////////////////////////
typedef BiTNode * QElemType;
typedef struct QNode {
QElemType data;
struct QNode * next;
}QNode, *QueuePtr;
typedef struct {
QueuePtr front;
QueuePtr rear;
}LinkQueue;
Status InitQueue_L(LinkQueue &Q) {
Q.front = (QueuePtr) malloc (sizeof(QNode));
if (Q.front == NULL)
return OVERFLOW;
Q.front->next = NULL;
Q.rear = Q.front;
return OK;
}
bool QueueEmpty_L(LinkQueue &Q) {
return (Q.front == Q.rear);
}
int QueueLength_L(LinkQueue &Q) {
int count = 0;
for (QNode *p = Q.front->next; p != NULL; p = p->next)
count++;
return count;
}
Status EnQueue_L(LinkQueue &Q, QElemType e) {
QNode *s = (QNode *) malloc (sizeof(QNode));
s->data = e;
s->next = NULL;
Q.rear->next = s;
Q.rear = s;
return OK;
}
Status DeQueue_L(LinkQueue &Q) {
QNode *q = Q.front->next;
Q.front->next = q->next;
if (q->next == NULL)
Q.rear = Q.front;
free(q);
return OK;
}
void PrintQueue_L(LinkQueue &Q) {
for (QNode *p = Q.front->next; p != NULL; p = p->next)
printf("%c", p->data->data);
printf("\n");
}
/////////////////////////////////
void CreateBiTree(BiTree &T);
void PreOrder(BiTree &T);
void InOrder(BiTree &T);
void PostOrder(BiTree &T);
void LevelOrder(BiTree &T);
int main() {
BiTree T;
CreateBiTree(T);
printf("PreOrder:");
PreOrder(T);
printf("\n");
printf("InOrder:");
InOrder(T);
printf("\n");
printf("PostOrder:");
PostOrder(T);
printf("\n");
printf("LevelOrder:");
LevelOrder(T);
printf("\n");
return 0;
}
#include <stack>
#include <queue>
using namespace std;
void CreateBiTree(BiTree &T)
{
char data;
data = getchar();
if(data == '#')
{
T = NULL;
}
else
{
T=(BiTNode *)malloc(sizeof(struct BiTNode));
T->data = data;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
}
void PreOrder(BiTree &T)
{
if(T)
{
printf("%c",T->data);
PreOrder(T->lchild);//遍歷左子樹
PreOrder(T->rchild);//遍歷右子樹
}
}
void InOrder(BiTree &T)
{
if(T)
{
InOrder(T->lchild);//遍歷左子樹
printf("%c",T->data);//輸出根節點值
InOrder(T->rchild);//遍歷右子樹
}
}
void PostOrder(BiTree &T)
{
if(T)
{
PostOrder(T->lchild);//遍歷左子樹
PostOrder(T->rchild);//遍歷右子樹
printf("%c",T->data);//輸出根節點值
}
}
void LevelOrder(BiTree &T)
{
if (!T)
{
return;
}
queue<BiTree> TreeQueue;
TreeQueue.push(T);
BiTree p = T;
while (!TreeQueue.empty())
{
p = TreeQueue.front();
TreeQueue.pop();
printf("%c", p->data);
if (p->lchild)
{
TreeQueue.push(p->lchild);
}
if (p->rchild)
{
TreeQueue.push(p->rchild);
}
}
}