一个功能简单的二叉树模板

#include <iostream>

using namespace std;
template<class T>
class BTree
{
private:
class Node
{
public:
T element;//Can be optimized
Node *LTree;
Node *RTree;
};
Node *root;
bool creat(Node *&root);
void show(Node *root)const;//Read Only
bool B_Delete(Node *&root);
public:
BTree();
~BTree();
void BTShow();
bool BTCreat();
void BTDelete();
};
template<class T>
BTree<T>::BTree()
{
root=NULL;
}
template<class T>
BTree<T>::~BTree()
{
B_Delete(root);
}
template<class T>
bool BTree<T>::BTCreat()
{
if(creat(root));
return true;
return false;
}
template<class T>
bool BTree<T>::creat(Node *&root)
{
T tempaval;
cin>>tempaval;
if(tempaval!='#')
{
root=new Node;
if(!root)
{
root=NULL;
return false;
}
root->element=tempaval;
if(!creat(root->LTree))
root->LTree=NULL;
if(!creat(root->RTree))
root->RTree=NULL;
}
else
return false;
return true;
}
template<class T>
bool BTree<T>::B_Delete(Node *&root)
{
if(root)
{
B_Delete(root->LTree);
B_Delete(root->RTree);
cout<<root->element<<ends;
delete root;
return true;
}
else
return false;
}
template<class T>
void BTree<T>::show(Node *root)const
{
if(root)
{
cout<<root->element<<ends;
show(root->LTree);
show(root->RTree);
}
else
return;
}
template<class T>
void BTree<T>::BTShow()
{
show(root);
}
int main()
{
BTree<char> temp1;
temp1.BTCreat();
temp1.BTShow();
cout << "Hello world!" << endl;
return 0;
}