数据结构——二叉树学习

对于二叉树的学习重要把握二叉树最多2个节点（左右节点）的特性 以及前中后层序遍历即可 

#include<iostream>
using namespace std;


template <class DataType> struct BiNode
{
DataType data;
BiNode <DataType>* lchild,* rchild;
};


template <class DataType>
class BiTree
{
public:
BiTree(){root = creat(root);};
~BiTree(){release(root);};
void preOrder(){preOrder(root);};
void inOrder(){inOrder(root);};
void postOrder(){postOrder(root);};
void levelOrder();
private:
BiNode<DataType> * root;//指向根节点的指针
BiNode<DataType>* creat(BiNode<DataType>* bt);
void release(BiNode<DataType>* bt);
void preOrder(BiNode<DataType>* bt);
void inOrder(BiNode<DataType>* bt);
void postOrder(BiNode<DataType>* bt);
BiNode<DataType> *data[100];
int front,rear;
};


template<class DataType> BiNode<DataType>* BiTree<DataType>::creat(BiNode<DataType>*bt)
{


char ch;
cin>>ch;
if(ch=='#')
{
bt = NULL;
}
else
{
bt = new BiNode<DataType>();
bt->data = ch;
bt->lchild = creat(bt->lchild);
bt->rchild = creat(bt->rchild);
}
return bt;
}


template<class DataType> void BiTree<DataType>::release(BiNode<DataType>* bt)
{
if(bt!=NULL)
{
release(bt->lchild);
release(bt->rchild);
delete bt;


}
}


template<class DataType> void BiTree<DataType>::preOrder(BiNode<DataType>* bt)
{
if(bt==NULL)
{
return;
}
else
{
cout<<bt->data<<" ";
preOrder(bt->lchild);
preOrder(bt->rchild);
}
}


template<class DataType> void BiTree<DataType>::inOrder(BiNode<DataType>* bt)
{
if(bt == nullptr)
{
return;
}
else
{
inOrder(bt->lchild);
cout<<bt->data<<" ";
inOrder(bt->rchild);
}
}


template<class DataType> void BiTree<DataType>::postOrder(BiNode<DataType>* bt)
{
if(bt==NULL)
{
return;
}
else
{
postOrder(bt->lchild);
postOrder(bt->rchild);
cout<<bt->data<<" ";
}
}


template<class DataType> void BiTree<DataType>::levelOrder()
{  
BiNode<DataType>* q ;
front = rear = -1;
if(root == NULL)
{
return;
}
data[++rear] = root;
while(rear!=front)
{
q = data[++front];
cout<<q->data<<" ";
if(q->lchild!= NULL)
{
data[++rear] = q->lchild;
}
if(q->rchild!=NULL)
{
data[++rear] = q->rchild;
}
}
}


int main()
{
BiTree<char> a;
a.preOrder();
cout<<endl;
a.inOrder();
cout<<endl;
a.postOrder();
cout<<endl;
a.levelOrder();
system("pause");


}