二叉树模板

#include<iostream>
using namespace std;
template<typename T>
struct BiNode {
	T data;
	BiNode* rchild, * lchild;
};
template<typename T>
class BiTree {
public:
	BiTree() { root = Creat(); }
	~BiTree() { Realse(root); }
	void PreOrder() { PreOrder(root); }
	void InOrder() { PreOrder(root); }
	void PostOrder() { PreOrder(root); }
	void LevelOrder();
	
private:
	BiNode<T>* root;
	BiNode<T>* Creat();
	void PreOrder(BiNode<T>* bt);
	void InOrder(BiNode<T>* bt);
	void PostOrder(BiNode<T>* bt);
	void Realse(BiNode<T>* bt);
	
};
template<typename T>
void BiTree<T>::PreOrder(BiNode<T>* bt) {
	if (bt != nullptr) {
		cout << bt->data;
		PreOrder(bt->lchild);
		PreOrder(bt->rchild);
	}
	else return;
}
template<typename T>
void BiTree<T>:: InOrder(BiNode<T>* bt) {
	if (bt != nullptr) {
		
		InOrder(bt->lchild);
		cout << bt->data;
		InOrder(bt->rchild);
	}
	else return;
}
template<typename T>
void BiTree<T>:: PostOrder(BiNode<T>* bt) {
	if (bt != nullptr) {

		PostOrder(bt->lchild);
		
		PostOrder(bt->rchild);
		cout << bt->data;
	}
	else return;
}
template<typename T>
void BiTree<T>::LevelOrder() {
	BiNode<T> Q[100], * q = nullptr;
	int front = -1, rear = -1;
	if (root == nullptr) {
		return;
	}
	Q[++rear] = root;
	while (front != rear) {
		q = Q[++front];
		cout << q->data << '\t';
		if (q->lchild != nullptr) {
			Q[++rear] = q->lchild;
		}
		if (q->rchild != nullptr) {
			Q[++rear] = q->rchild;
		}
	}
}
template<typename T>
BiNode<T>* BiTree<T>::Creat() {
	BiNode<T>* bt=nullptr;
	char ch; cin >> ch;
	if (ch != '#') {
		bt = new BiNode<T>;
		bt->data = ch;
		bt->lchild = Creat();
		bt->rchild = Creat();
	}
	else return bt;
}
template <typename T>
void BiTree<T>::Realse(BiNode<T>* bt) {
	if (bt == nullptr)
		return;
	else {
		Realse(bt->lchild);
		Realse(bt->rchild);
		delete bt;
	}
}
int main() {
	BiTree<char> T;
	T.PreOrder();
}