老师的代码:
#include <stdio.h>
#include <malloc.h>
#define QUEUE_SIZE 5
/**
* Binary tree node.
*/
typedef struct BTNode{
char element;
BTNode* left;
BTNode* right;
}BTNode, *BTNodePtr;
/**
* A queue with a number of pointers.
*/
typedef struct BTNodePtrQueue{
BTNodePtr* nodePtrs;
int front;
int rear;
}BTNodePtrQueue, *QueuePtr;
/**
* Initialize the queue.
*/
QueuePtr initQueue(){
QueuePtr resultQueuePtr = (QueuePtr)malloc(sizeof(struct BTNodePtrQueue));
resultQueuePtr->nodePtrs = (BTNodePtr*)malloc(QUEUE_SIZE * sizeof(BTNodePtr));
resultQueuePtr->front = 0;
resultQueuePtr->rear = 1;
return resultQueuePtr;
}//Of initQueue
/**
* Is the queue empty?
*/
bool isQueueEmpty(QueuePtr paraQueuePtr){
if ((paraQueuePtr->front + 1) % QUEUE_SIZE == paraQueuePtr->rear) {
return true;
}//Of if
return false;
}//Of isQueueEmpty
/**
* Add a pointer to the queue.
*/
void enqueue(QueuePtr paraQueuePtr, BTNodePtr paraBTNodePtr){
printf("front = %d, rear = %d.\r\n", paraQueuePtr->front, paraQueuePtr->rear);
if ((paraQueuePtr->rear + 1) % QUEUE_SIZE == paraQueuePtr->front % QUEUE_SIZE) {
printf("Error, trying to enqueue %c. queue full.\r\n", paraBTNodePtr->element);
return;
}//Of if
paraQueuePtr->nodePtrs[paraQueuePtr->rear] = paraBTNodePtr;
paraQueuePtr->rear = (paraQueuePtr->rear + 1) % QUEUE_SIZE;
printf("enqueue %c ends.\r\n", paraBTNodePtr->element);
}//Of enqueue
/**
* Remove an element from the queue and return.
*/
BTNodePtr dequeue(QueuePtr paraQueuePtr){
if (isQueueEmpty(paraQueuePtr)) {
printf("Error, empty queue\r\n");
return NULL;
}//Of if
paraQueuePtr->front = (paraQueuePtr->front + 1) % QUEUE_SIZE;
//BTNodePtr tempPtr = paraQueuePtr->nodePtrs[paraQueuePtr->front + 1];
printf("dequeue %c ends.\r\n", paraQueuePtr->nodePtrs[paraQueuePtr->front]->element);
return paraQueuePtr->nodePtrs[paraQueuePtr->front];
}//Of dequeue
/**
* Construct a BTNode using the given char.
*/
BTNodePtr constructBTNode(char paraChar){
BTNodePtr resultPtr = (BTNodePtr)malloc(sizeof(BTNode));
resultPtr->element = paraChar;
resultPtr->left = NULL;
resultPtr->right = NULL;
return resultPtr;
}//Of constructBTNode
/**
* Construct a binary tree using the given string.
*/
BTNodePtr stringToBTree(char* paraString){
int i;
char ch;
//Use a queue to manage the pointers
QueuePtr tempQueuePtr = initQueue();
BTNodePtr resultHeader;
BTNodePtr tempParent, tempLeftChild, tempRightChild;
i = 0;
ch = paraString[i];
resultHeader = constructBTNode(ch);
enqueue(tempQueuePtr, resultHeader);
while(!isQueueEmpty(tempQueuePtr)) {
tempParent = dequeue(tempQueuePtr);
//The left child
i ++;
ch = paraString[i];
if (ch == '#') {
tempParent->left = NULL;
} else {
tempLeftChild = constructBTNode(ch);
enqueue(tempQueuePtr, tempLeftChild);
tempParent->left = tempLeftChild;
}//Of if
//The right child
i ++;
ch = paraString[i];
if (ch == '#') {
tempParent->right = NULL;
} else {
tempRightChild = constructBTNode(ch);
enqueue(tempQueuePtr, tempRightChild);
tempParent->right = tempRightChild;
}//Of if
}//Of while
return resultHeader;
}//Of stringToBTree
/**
* Levelwise.
*/
void levelwise(BTNodePtr paraTreePtr){
//Use a queue to manage the pointers
char tempString[100];
int i = 0;
QueuePtr tempQueuePtr = initQueue();
BTNodePtr tempNodePtr;
enqueue(tempQueuePtr, paraTreePtr);
while(!isQueueEmpty(tempQueuePtr)) {
tempNodePtr = dequeue(tempQueuePtr);
//For output.
tempString[i] = tempNodePtr->element;
i ++;
if (tempNodePtr->left != NULL){
enqueue(tempQueuePtr, tempNodePtr->left);
}//Of if
if (tempNodePtr->right != NULL){
enqueue(tempQueuePtr, tempNodePtr->right);
}//Of if
}//Of while
tempString[i] = '\0';
printf("Levelwise: %s\r\n", tempString);
}//Of levelwise
/**
* Preorder.
*/
void preorder(BTNodePtr tempPtr){
if (tempPtr == NULL){
return;
}//Of if
printf("%c", tempPtr->element);
preorder(tempPtr->left);
preorder(tempPtr->right);
}//Of preorder
/**
* Inorder.
*/
void inorder(BTNodePtr tempPtr){
if (tempPtr == NULL) {
return;
}//Of if
inorder(tempPtr->left);
printf("%c", tempPtr->element);
inorder(tempPtr->right);
}//Of inorder
/**
* Post order.
*/
void postorder(BTNodePtr tempPtr){
if (tempPtr == NULL) {
return;
}//Of if
postorder(tempPtr->left);
postorder(tempPtr->right);
printf("%c", tempPtr->element);
}//Of postorder
/**
* The entrance.
*/
int main(){
BTNodePtr tempHeader;
tempHeader = constructBTNode('c');
printf("There is only one node. Preorder visit: ");
preorder(tempHeader);
printf("\r\n");
char* tempString = "acde#bf######";
tempHeader = stringToBTree(tempString);
printf("Preorder: ");
preorder(tempHeader);
printf("\r\n");
printf("Inorder: ");
inorder(tempHeader);
printf("\r\n");
printf("Postorder: ");
postorder(tempHeader);
printf("\r\n");
printf("Levelwise: ");
levelwise(tempHeader);
printf("\r\n");
return 1;
}//Of main
我的代码:
#include <stdio.h>
#include <malloc.h>
#include <stdbool.h>
#define QUEUE_SIZE 5//队列空间大小
/*二叉树的二叉链式存储表示*/
typedef struct BTNode{
char element;
struct BTNode* leftChild;
struct BTNode* rightChild;
}BTNode,*BTNodePtr;
/*二叉树队列的表示*/
typedef struct BTNodeQueue{
BTNodePtr* nodePtrs; //队列里存放的是二叉树结点的地址
int front;
int rear;
}BTNodeQueue,*BTNodeQueuePtr;
/*二叉树队列的初始化(QueuePtr及其成员的空间分配及赋初值)*/
BTNodeQueuePtr initQueue(){
BTNodeQueuePtr QueuePtr=(BTNodeQueuePtr)malloc(sizeof(struct BTNodeQueue));
QueuePtr->nodePtrs=(BTNodePtr*)malloc(QUEUE_SIZE*sizeof(struct BTNode));//队列的空间用来存二叉树结点的地址
QueuePtr->front=0;
QueuePtr->rear=1;
return QueuePtr;
}
/*判断是否队空(bool)*/
bool isQueueEmpty(BTNodeQueuePtr paraQueue){
if((paraQueue->front+1)%QUEUE_SIZE==paraQueue->rear){
return true;
}
return false;
}
/*结点指针入队(传两个参数:QueuePtr、NodePtr)*/
void enqueue(BTNodeQueuePtr paraQueue,BTNodePtr paraBTNodePtr){
//判断队列是否已满
if((paraQueue->rear+1)%QUEUE_SIZE==paraQueue->front%QUEUE_SIZE){
printf("The queue is full.Cannot enqueue data %c.\r\n",paraBTNodePtr->element);
}
//结点指针入队
paraQueue->nodePtrs[paraQueue->rear]=paraBTNodePtr;
paraQueue->rear=(paraQueue->rear+1)%QUEUE_SIZE;
printf("%c has enqueued.\r\n",paraBTNodePtr->element);
}
/*结点指针出队*/
BTNodePtr dequeue(BTNodeQueuePtr paraQueue){
//判断队列是否为空
if(paraQueue->front==paraQueue->rear){
printf("The queue is empty.Cannot dequeue element.\r\n");
return NULL;
}
//结点指针出队
paraQueue->front=(paraQueue->front+1)%QUEUE_SIZE;//front最初指向出队元素的前面的一个位置,现在让front指向出队指针
printf("dequeue %c ends.\r\n",paraQueue->nodePtrs[paraQueue->front]->element);
return paraQueue->nodePtrs[paraQueue->front];
}
/*创建二叉树结点*/
BTNodePtr constructBTNode(char parachar){
BTNodePtr tempNode=(BTNodePtr)malloc(sizeof(struct BTNode));
tempNode->element=parachar;
tempNode->leftChild=NULL;
tempNode->rightChild=NULL;
return tempNode;
}
/*用给定字符串创建二叉树*/
BTNodePtr stringToBTree(char* paraString){
int i,ch;
//初始化指针队列
BTNodeQueuePtr tempQueue=initQueue();
//头结点指针入队
BTNodePtr Header,tempParent,tempLeftChild,tempRightChild;
i=0;ch=paraString[i];Header=constructBTNode(ch);
enqueue(tempQueue,Header);
//创建子树
while(!isQueueEmpty(tempQueue)){
tempParent=dequeue(tempQueue);
//leftchild
i++;ch=paraString[i];
if(ch=='#'){
tempParent->leftChild=NULL;
}else{
tempLeftChild=constructBTNode(ch);
enqueue(tempQueue,tempLeftChild);
tempParent->leftChild=tempLeftChild;
}
//rightchild
i++;ch=paraString[i];
if(ch=='#'){
tempParent->rightChild=NULL;
}else{
tempRightChild=constructBTNode(ch);
enqueue(tempQueue,tempRightChild);
tempParent->rightChild=tempRightChild;
}
}//Of while
return Header;
}
/*层次遍历(队列)(while循环)*/
void levelwise(BTNodePtr paraTreePtr){
BTNodePtr tempNodePtr;//接受出队的结点指针
int i=0;char tempString[100];//将结点的字符依次保存在字符串中,方便输出
//初始化队列存储结点指针
BTNodeQueuePtr tempQueue=initQueue();
enqueue(tempQueue,paraTreePtr);
while(!isQueueEmpty(tempQueue)){
tempNodePtr=dequeue(tempQueue);
tempString[i]=tempNodePtr->element;
i++;
if(tempNodePtr->leftChild!=NULL){
enqueue(tempQueue,tempNodePtr->leftChild);
}
if(tempNodePtr->rightChild!=NULL){
enqueue(tempQueue,tempNodePtr->rightChild);
}
}
tempString[i]=='\0';
printf("Levelwise:%s\r\n",tempString);
}
/*先序遍历(递归)*/
void preOrder(BTNodePtr tempPtr){
if(tempPtr==NULL){
return;
}
printf("%c",tempPtr->element);
preOrder(tempPtr->leftChild);
preOrder(tempPtr->rightChild);
}
/*中序遍历(递归)*/
void inOrder(BTNodePtr tempPtr){
if(tempPtr==NULL){
return;
}
inOrder(tempPtr->leftChild);
printf("%c",tempPtr->element);
inOrder(tempPtr->rightChild);
}
/*后序遍历(递归)*/
void poOrder(BTNodePtr tempPtr){
if(tempPtr==NULL){
return;
}
poOrder(tempPtr->leftChild);
poOrder(tempPtr->rightChild);
printf("%c",tempPtr->element);
}
int main(){
BTNodePtr tempHeader;//保存根节点
//单个字符
tempHeader=constructBTNode('c');
printf("There is only one node.preOrder visit:\r\n");
preOrder(tempHeader);
printf("\r\n");
//字符串
printf("---- the stringToBTree begins. ----\r\n");
char *tempString="acde#bf######";
tempHeader=stringToBTree(tempString);
printf("---- the stringToBTree ends. ----\r\n");
printf("---- traversal begins, ----\r\n");
printf("preOrder:");
preOrder(tempHeader);
printf("\r\n");
printf("inOrder:");
inOrder(tempHeader);
printf("\r\n");
printf("poOrder:");
poOrder(tempHeader);
printf("\r\n");
printf("Levelwise:\r\n");
levelwise(tempHeader);
printf("---- traversal ends, ----\r\n");
return 0;
}
运行结果: