实验五

#include<iostream>

using namespace std;

#ifndef BiTree_H

#define BiTree_H

struct BiNode

{

char data;

BiNode *lchild,*rchild;

};

class BiTree

{

public:

BiTree(){root=Creat(root);}

~BiTree(){Release(root);}

void PreOrder(){PreOrder(root);}

void InOrder(){InOrder(root);}

void PostOrder(){PostOrder(root);}

private:

BiNode *root;

BiNode *Creat(BiNode *bt);

void Release(BiNode *bt);

void PreOrder(BiNode *bt);

void InOrder(BiNode *bt);

void PostOrder(BiNode *bt);

};

BiNode *BiTree::Creat(BiNode *bt)

{

char ch;

cout<<"请输入创建一棵二叉树结点数据"<<endl;

cin>>ch;

if(ch=='#')return NULL;

else

{bt=new BiNode;

bt->data=ch;

bt->lchild=Creat(bt->lchild);

bt->rchild=Creat(bt->rchild);

}

return bt;

}

void BiTree::Release(BiNode *bt)

{

if(bt!=NULL)

{Release(bt->lchild);

Release(bt->rchild);

delete bt;

}

}

void BiTree::PreOrder(BiNode *bt)

{

if(bt==NULL)return;

else

{cout<<bt->data<<" ";

PreOrder(bt->lchild);

PreOrder(bt->rchild);

}

}

void BiTree::InOrder(BiNode *bt)

{

if(bt==NULL)return;

else

{InOrder(bt->lchild);

cout<<bt->data<<" ";

InOrder(bt->rchild);}

}

void BiTree::PostOrder(BiNode *bt)

{

if(bt==NULL)return;

else

{PostOrder(bt->lchild);

PostOrder(bt->rchild);

cout<<bt->data<<" ";

}

}

int main()

{

BiTree tree;

cout<<"-------前序遍历-------"<<endl;

tree.PreOrder();

cout<<endl;

cout<<"-------中序遍历-------"<<endl;

tree.InOrder();

cout<<endl;

cout<<"-------后序遍历-------"<<endl;

tree.PostOrder();

cout<<endl;

return 0;

}

#endif