二叉树的创建与遍历

二叉树的创建与遍历

//创建二叉树节点

typedef struct BTNode {
	char element;
	BTNode *left;
	BTNode *right;
} BTNode, *BTNodePtr;

//创建队列

typedef struct BTNodePtrQueue {
	BTNodePtr *nodePtrs;
	int front;
	int rear;
} BTNodePtrQueue, *QueuePtr;

//初始化队列

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

//判断队列是否为空

bool isQueueEmpty(QueuePtr paraQueuePtr) {
	if ((paraQueuePtr->front + 1) % QUEUE_SIZE == paraQueuePtr->rear) {
		return true;
	}

	return false;
}

//加入队列

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

	//往队列中加入节点

	paraQueuePtr->nodePtrs[paraQueuePtr->rear] = paraBTNodePtr;

	paraQueuePtr->rear = (paraQueuePtr->rear + 1) % QUEUE_SIZE;
	printf("enqueue %c ends.\r\n", paraBTNodePtr->element);
}

//删除节点

BTNodePtr dequeue(QueuePtr paraQueuePtr) {
	//判断是否为空
	if (isQueueEmpty(paraQueuePtr)) {
		printf("Error, empty queue\r\n");
		return NULL;
	}

	paraQueuePtr->front = (paraQueuePtr->front + 1) % QUEUE_SIZE;

	//返回节点

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

//创建二叉树的节点

BTNodePtr constructBTNode(char paraChar) {
	BTNodePtr resultPtr = (BTNodePtr)malloc(sizeof(BTNode));
	resultPtr->element = paraChar;
	resultPtr->left = NULL;
	resultPtr->right = NULL;
	return resultPtr;
}

//创建二叉树

BTNodePtr stringToBTree(char *paraString) {
	int i;
	char ch;


	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);
		//删除队列


		//左子树

		i ++;
		ch = paraString[i];

		if (ch == '#') {
			//判断是否为空节点

			tempParent->left = NULL;
		} else {
			//同样 插入左孩子

			tempLeftChild = constructBTNode(ch);
			enqueue(tempQueuePtr, tempLeftChild);
			tempParent->left = tempLeftChild;
		}


		//右孩子
		//同理
		i ++;
		ch = paraString[i];

		if (ch == '#') {
			tempParent->right = NULL;
		} else {
			tempRightChild = constructBTNode(ch);
			enqueue(tempQueuePtr, tempRightChild);
			tempParent->right = tempRightChild;
		}
	}

	return resultHeader;
}

//层序遍历

void levelwise(BTNodePtr paraTreePtr) {

	char tempString[100];
	int i = 0;
	QueuePtr tempQueuePtr = initQueue();
	BTNodePtr tempNodePtr;
	enqueue(tempQueuePtr, paraTreePtr);

	while (!isQueueEmpty(tempQueuePtr)) {
		tempNodePtr = dequeue(tempQueuePtr);

		//输出
		tempString[i] = tempNodePtr->element;
		i ++;

		if (tempNodePtr->left != NULL) {
			enqueue(tempQueuePtr, tempNodePtr->left);
		}

		if (tempNodePtr->right != NULL) {
			enqueue(tempQueuePtr, tempNodePtr->right);
		}
	}

	tempString[i] = '\0';

	printf("Levelwise: %s\r\n", tempString);
}

先中后序遍历

//前序遍历
void preorder(BTNodePtr tempPtr) {
	if (tempPtr == NULL) {
		return;
	}

	printf("%c", tempPtr->element);
	preorder(tempPtr->left);
	preorder(tempPtr->right);
}


//中序遍历
void inorder(BTNodePtr tempPtr) {
	if (tempPtr == NULL) {
		return;
	}

	inorder(tempPtr->left);
	printf("%c", tempPtr->element);
	inorder(tempPtr->right);
}


//后序遍历
void postorder(BTNodePtr tempPtr) {
	if (tempPtr == NULL) {
		return;
	}

	postorder(tempPtr->left);
	postorder(tempPtr->right);
	printf("%c", tempPtr->element);
}

main

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