这是什么？二叉树？遍历一下

看看code

#define _CRT_SECURE_NO_WARNINGS 1
#include<malloc.h>
#include<stdio.h>
 
#define QUEUE_SIZE 5
 
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;
	}// of if
	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;
	BTNodePtr tempPtr = paraQueuePtr->NodePtrs[paraQueuePtr ->front + 1];
 
	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, tempLeft, tempRight;
	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 {
			tempLeft = constructBTNode(ch);
			enqueue(tempQueuePtr, tempLeft);
			tempParent->left = tempLeft;
		}
 
		i++;
		ch = paraString[i];
		if (ch == '#') {
			tempParent->right = NULL;
		}
		else {
			tempRight = constructBTNode(ch);
			enqueue(tempQueuePtr, tempRight);
			tempParent->right = tempRight;
		}
	} 
	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->right);
		}
	}
	tempString[i] = '\0';
 
	printf("Levelwise: %s\r\n", tempString);
} 

void preorder(BTNodePtr tempPtr) {
	if (tempPtr == NULL) {
		return;
	}// of if
 
	printf("%c", tempPtr->element);
	preorder(tempPtr->left);
	preorder(tempPtr->right);
}// of preorder
 

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

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

看看运行出来是什么

那么，这是个什么玩意呢

 二叉树是一种树形数据结构，其中每个节点最多有两个子节点，称为左子节点和右子节点。二叉树可以为空，或者由一个根节点和两个子树组成，每个子树也是二叉树。二叉树的遍历方式有前序遍历、中序遍历和后序遍历。根左右为前序遍历，左根右为中序遍历，左右根为后序遍历。