3.《数据结构与算法(C语言)》练习题库一树与二叉树-ANSWER.zip

#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; } /* 你的代码将被嵌在这里 */ void InorderTraversal(BinTree BT) { if (BT == NULL) return; InorderTraversal(BT->Left); printf(" %c", BT->Data); InorderTraversal(BT->Right); } void PreorderTraversal(BinTree BT) { if (BT == NULL) return; printf(" %c", BT->Data); PreorderTraversal(BT->Left); PreorderTraversal(BT->Right); } void PostorderTraversal(BinTree BT) { if (BT == NULL) return; PostorderTraversal(BT->Left); PostorderTraversal(BT->Right); printf(" %c", BT->Data); } void LevelorderTraversal(BinTree BT) { if (BT == NULL) return; BinTree q[100]; int front = -1, rear = -1; rear++; q[rear] = BT; while (front != rear) { front++; BinTree tmp = q[front]; printf(" %c", tmp->Data); if (tmp->Left) { rear++; q[rear] = tmp->Left; } if (tmp->Right) { rear++; q[rear] = tmp->Right; } } }