C/C++ 树与二叉树

本文的所有代码都是放在一个CPP文件中，由于涉及的函数较多，因此分模块贴出，方便阅读和查询

数据结构：

typedef struct BiTNode {
	int data;
	struct BiTNode* lchild, * rchild;
}BiTNode,*BiTree;

四种二叉树遍历方式：

这里偷懒了下，在层次遍历中使用了STL容器中的queue，因此需要加入头文件"#include"

void visit(BiTNode* node) {	//访问节点
	printf("%d ", node->data);
}
void PreOrder(BiTree T) {	//先序遍历
	if (T != NULL) {
		visit(T);
		PreOrder(T->lchild);
		PreOrder(T->rchild);
	}
}
void InOrder(BiTree T) {	//中序遍历
	if (T != NULL) {
		InOrder(T->lchild);
		visit(T);
		InOrder(T->rchild);
	}
}
void PostOrder(BiTree T) {	//后序遍历
	if (T != NULL) {
		PostOrder(T->lchild);
		PostOrder(T->rchild);
		visit(T);
	}
}
void LevelOrder(BiTree T) {	//层次遍历
	if (T == NULL)	return;
	queue<BiTNode*> Q;
	Q.push(T);
	while (!Q.empty()) {
		BiTNode* p = Q.front();
		Q.pop();
		visit(p);
		if (p->lchild != NULL)	Q.push(p->lchild);
		if (p->rchild != NULL)	Q.push(p->rchild);
	}
}

三种二叉树构造方式：

//N为节点数，A为先序遍历，B为中序遍历
BiTree CreateTree_by_Pre_and_In(int N, int A[], int B[]) {
	if (N <= 0)	return NULL;
	BiTNode* root = (BiTNode*)malloc(sizeof(BiTNode));
	root->data = A[0];
	int i = 0;
	while (B[i] != A[0])	i++;
	root->lchild = CreateTree_by_Pre_and_In(i,&A[1],B);
	root->rchild = CreateTree_by_Pre_and_In(N - i - 1, &A[i + 1], &B[i + 1]);
	return root;
}
//N为节点数，A为后序遍历，B为中序遍历
BiTree CreateTree_by_Post_and_In(int N, int A[], int B[]) {
	if (N <= 0)	return NULL;
	BiTNode* root=(BiTNode*)malloc(sizeof(BiTNode));
	root->data = A[N - 1];
	int i = 0;
	while (A[N - 1] != B[i])	i++;
	root->lchild = CreateTree_by_Post_and_In(i, A, B);
	root->rchild = CreateTree_by_Post_and_In(N - i - 1, &A[i], &B[i + 1]);
	return root;
}

完整代码：

#include<iostream>
#include<queue>
using namespace std;
typedef struct BiTNode {
	int data;
	struct BiTNode* lchild, * rchild;
}BiTNode,*BiTree;
BiTree CreateTree_by_Pre_and_In(int N, int A[], int B[]) {
	if (N <= 0)	return NULL;
	BiTNode* root = (BiTNode*)malloc(sizeof(BiTNode));
	root->data = A[0];
	int i = 0;
	while (B[i] != A[0])	i++;
	root->lchild = CreateTree_by_Pre_and_In(i,&A[1],B);
	root->rchild = CreateTree_by_Pre_and_In(N - i - 1, &A[i + 1], &B[i + 1]);
	return root;
}
BiTree CreateTree_by_Post_and_In(int N, int A[], int B[]) {
	if (N <= 0)	return NULL;
	BiTNode* root=(BiTNode*)malloc(sizeof(BiTNode));
	root->data = A[N - 1];
	int i = 0;
	while (A[N - 1] != B[i])	i++;
	root->lchild = CreateTree_by_Post_and_In(i, A, B);
	root->rchild = CreateTree_by_Post_and_In(N - i - 1, &A[i], &B[i + 1]);
	return root;
}
void visit(BiTNode* node) {
	printf("%d ", node->data);
}
void PreOrder(BiTree T) {
	if (T != NULL) {
		visit(T);
		PreOrder(T->lchild);
		PreOrder(T->rchild);
	}
}
void InOrder(BiTree T) {
	if (T != NULL) {
		InOrder(T->lchild);
		visit(T);
		InOrder(T->rchild);
	}
}
void PostOrder(BiTree T) {
	if (T != NULL) {
		PostOrder(T->lchild);
		PostOrder(T->rchild);
		visit(T);
	}
}
void LevelOrder(BiTree T) {
	if (T == NULL)	return;
	queue<BiTNode*> Q;
	Q.push(T);
	while (!Q.empty()) {
		BiTNode* p = Q.front();
		Q.pop();
		visit(p);
		if (p->lchild != NULL)	Q.push(p->lchild);
		if (p->rchild != NULL)	Q.push(p->rchild);
	}
}
int main() {
	int A[] = {1,2,4,5,3,6,7};			//先序遍历
	int B[] = { 4,2,5,1,3,7,6 };		//中序遍历
	int C[] = { 4,5,2,7,6,3,1 };		//后序遍历
	int D[] = { 1,2,3,4,5,6,7 };		//层序遍历
	int N = 7;
	//BiTree T = CreateTree_by_Pre_and_In(N, A, B);
	BiTree T = CreateTree_by_Post_and_In(N, C, B);
	LevelOrder(T);
	return 0;
}

。。。。待完善