头文件BiTree.h
#include<iostream>
const int MAXSIZE=20;template<class T>
struct BiTNode
{
T data;
struct BiTNode<T> *lch;
struct BiTNode<T> *rch;
};
template<class T>
class BiTree
{
void Create(BiTNode<T>* &R, T a[], int i);
void Destroy(BiTNode<T>* R);
public:
BiTNode<T> *root;
BiTree();
BiTree(T a[]);
~BiTree();
int GetDeepth(BiTNode<T> *R);
int LeafCount(BiTNode<T> *R); ///求叶子节点数量
int Count(BiTNode<T> *R); ///求结点总数
void PreOrder1(BiTNode<T> *R);
void InOrder1(BiTNode<T> *R);
void PostOrder1(BiTNode<T> *R);
void LevelOrder(BiTNode<T> *R);
void PreOrder2(BiTNode<T> *R);
void PreOrder3(BiTNode<T> *R);
void InOrder2(BiTNode<T> *R);
void InOrder3(BiTNode<T> *R);
void PostOrder2(BiTNode<T> *R);
void PostOrder3(BiTNode<T> *R);
};
///==========================函数的具体实现==========================
template<class T>
void BiTree<T>::Create(BiTNode<T>* &R, T a[], int i)
{
if(a[i-1] != '0' && a[i-1] != 0)
{
R = new BiTNode<T>;
R->data = a[i-1];
R->lch = R->rch = NULL;
Create(R->lch, a, 2*i);
Create(R->rch, a, 2*i+1);
}
}
template<class T>
void BiTree<T>::Destroy(BiTNode<T>* R)
{
if(R)
{
Destroy(R->lch);
Destroy(R->rch);
delete R;
}
}
template<class T>
BiTree<T>::BiTree(T a[])
{
Create(root, a, 1);
}
template<class T>
BiTree<T>::BiTree()
{
std::cout<<"请输入二叉树所有结点个数(包含空结点):";
int size;
std::cin>>size;
if(size>MAXSIZE) throw"二叉树结点过多,请适当减少";
std::cout<<"开始输入(以0表示空结点):";
T a[size];
for(int i=0; i<size; ++i)
{
std::cin>>a[i];
}
Create(root, a, 1);
}
<