C++二叉树（类）

 二叉树（建立用的是返回值类型  ，前序、中序、后序 递归遍历） 

#include
#include
using namespace std;
template 
struct root
{
	T val;
	root *left;
	root* right;
};
template 
class BiTree
{
public:
	BiTree() { r = NULL; }
	~BiTree() { clear(r);  }
	void  Build() { r = BuildTree(); }//建树
	void PreOrder() { PreOrder(r); }//前序
	void PreOrder1();  //非递归前序
	void InOrder() { InOrder(r); }//中序
	void EndOrder() { EndOrder(r); }//后序
	void clear() { clear(r); r = NULL;}//清空
private:
	root* BuildTree();
	void clear(root* &r1);
	void PreOrder(root* r);
	void InOrder(root* r);
	void EndOrder(root* r);
	root* r;
};
template
void BiTree::clear(root* &r1)
{
	if (!r1) return;
	clear(r1->left);
	clear(r1->right);
	delete r1;
}

template 
root * BiTree::BuildTree()
{
	root* k;
	char c;
	cin >> c;
	if (c == '#') return NULL;
	k = new root;
	k->val = c;
	k->left = BuildTree();
	k->right = BuildTree();
	return k;
}
template
void BiTree::PreOrder(root* r)
{
	if (!r) return;
	cout << r->val << " ";
	PreOrder(r->left);
	PreOrder(r->right);
}
template
void BiTree::PreOrder1()
{
	if (r == NULL) return;
	stack*> s;
	root* t = r;
	while (t || !s.empty())
	{
		while(t)
		{	
			cout << t->val << " ";
			s.push(t);
			t = t->left;
		}
		if (!s.empty())
		{
			t = s.top();	
			s.pop();
			t = t->right;
		}
	}	
}
template
void BiTree::InOrder(root* r)
{
	if (!r) return;
	InOrder(r->left);
	cout << r->val << " ";
	InOrder(r->right);
}
template
void BiTree::EndOrder(root* r)
{
	if (!r) return;
	EndOrder(r->left);
	EndOrder(r->right);
	cout << r->val << " ";
}
int main()
{
	BiTree r;
	r.Build();
	r.PreOrder();
	cout << endl;
	r.PreOrder1();
	cout << endl;
	//r.InOrder();
	//cout << endl;
	//r.EndOrder();
	//cout << endl;
	//abc##d##e##
	return 0;
}