二叉树的建立与遍历

先上代码，再说废话

#define _CRT_SECURE_NO_WARNINGS 1
#include<malloc.h>
#include<stdio.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 idQueueEmpty

/*
* 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 tehe 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, tempLeft, tempRight;
	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 {
			tempLeft = constructBTNode(ch);
			enqueue(tempQueuePtr, tempLeft);
			tempParent->left = tempLeft;
		}// of if

		// The right child
		i++;
		ch = paraString[i];
		if (ch == '#') {
			tempParent->right = NULL;
		}
		else {
			tempRight = constructBTNode(ch);
			enqueue(tempQueuePtr, tempRight);
			tempParent->right = tempRight;
		}// of if
	}// of while

	return resultHeader;
}// of stringHeader

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

/*
 * Postorder 后序遍历
 */
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 node. Preorder visit: ");
	preorder(tempHeader);

	char* tempString = "acde#bf######";

	tempHeader = stringToBtree(tempString);
	printf("preorder: ");
	preorder(tempHeader);
	printf("\r\n");
	printf("Inorder: ");
	inorder(tempHeader);
	printf("\r\n");
	printf("PostHeader: ");
	postorder(tempHeader);
	printf("\r\n");
	printf("Levelwise: ");
	levelwise(tempHeader);
	printf("\r\n");

	return 1;
}// of main

运行结果

There is only one node. Preorder visit: c
front = 0, rear = 1.
enqueue a ends.
dequeue a ends.
front = 1, rear = 2.
enqueue c ends.
front = 1, rear = 3.
enqueue d ends.
dequeue c ends.
front = 2, rear = 4.
enqueue e ends.
dequeue d ends.
front = 3, rear = 0.
enqueue b ends.
front = 3, rear = 1.
enqueue f ends.
dequeue e ends.
dequeue b ends.
dequeue f ends.
Preorder: acedbf
Inorder: ecabdf
Postorder: ecbfda
Levelwise: front = 0, rear = 1.
enqueue a ends.
dequeue a ends.
front = 1, rear = 2.
enqueue c ends.
front = 1, rear = 3.
enqueue d ends.
dequeue c ends.
front = 2, rear = 4.
enqueue e ends.
dequeue d ends.
front = 3, rear = 0.
enqueue b ends.
front = 3, rear = 1.
enqueue f ends.
dequeue e ends.
dequeue b ends.
dequeue f ends.
Levelwise: acdebf

Press any key to continue

说明

二叉树是一种树形数据结构，其中每个节点最多有两个子节点，称为左子节点和右子节点。二叉树可以为空，或者由一个根节点和两个子树组成，每个子树也是二叉树。二叉树的遍历方式有前序遍历、中序遍历和后序遍历。在前序遍历中，先访问根节点，然后访问左子树，最后访问右子树；在中序遍历中，先访问左子树，然后访问根节点，最后访问右子树；在后序遍历中，先访问左子树，然后访问右子树，最后访问根节点。二叉树的应用非常广泛，例如在搜索算法、排序算法、图形算法等领域都有广泛的应用。