C++二叉数的层序遍历，前序遍历，中序遍历，后序遍历的实现方法

C++二叉数的层序遍历，前序遍历，中序遍历，后序遍历的实现方法

先上代码

#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;

typedef char ElemType;

typedef struct Node {
    ElemType date;
	struct Node* left;
	struct Node* right;
}BinTreeNode,*BinTree;

void preOrder(BinTree T) {       //前序遍历
	if (!T) {
		return;
	}
	cout << T->date;
	preOrder(T->left);
	preOrder(T->right);
}
//直接照搬教材，递归实现
void inOrder(BinTree T) {          //中序遍历
	if (!T) {
		return;
	}
	inOrder(T->left);
	cout << T->date;
	inOrder(T->right);
}
//直接照搬教材，递归实现
void posOrder(BinTree T) {             //后序遍历
	if (!T) {
		return;
	}
	posOrder(T->left);
	posOrder(T->right);
	cout << T->date;
}
//直接照搬教材，递归实现
void layerOrder(BinTree T) {           //层序遍历
	int i = 1;
	vector<BinTree> a = {T};
	vector<BinTree> b;
	while (!empty(a))
	{
		for (int i=0; i < size(a); i++) {
			cout<<a[i]->date;
		}
		int j = 0;
		for (int i = 0; i < size(a); i++) {
			if (a[i]->left != NULL) {
				b.push_back(a[i]->left);
				j++;
			}
			if (a[i]->right != NULL) {
				b.push_back(a[i]->right);
				j++;
			}
		}
		a = b;
		b.clear();
	}
	cout << endl;
}
//层序遍历算法通过vector容器实现,之前寻思用数组来实现，给干懵了。
//初学者心累啊
void create(BinTree& T) {
	char ch;
	cout << "请输入下一结点信息" << endl;
	cin >> ch;
	if (ch == '#') {
		T = NULL;
	}
	else {
		T = (BinTreeNode*)malloc(sizeof(BinTreeNode));
		T->date = ch;
		create(T->left);
		create(T->right);
	}
}
//这里是通过一个一个输入前序序列的方式来创建二叉树
//输入时要注意将空子树用#号表示，比较繁琐，注意别输错了
void test1() {
	BinTree T1=NULL;
	create(T1);
	cout << "中序遍历:" << endl;
	inOrder(T1);
	cout << endl;
	cout << "后序遍历:" << endl;
	posOrder(T1);
	cout << endl;
	cout << "层序遍历" << endl;
	layerOrder(T1);
}

void main()
{
	test1();
}