数据结构 二叉树

#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 ith 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 initqueuePtr;

/*
*	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;

	printf("dequeue % c ends.\r\n", paraQueuePtr->nodePTrs[paraQueuePtr->front]->element);
	return paraQueuePtr->nodePTrs[paraQueuePtr->front];
};

/*
	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
	}// 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

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;
}

运行结果