数据结构实验五

#ifndef Tree_H

#define Tree_h

#include<iostream>

using namespace std;

 

struct BiNode

{

char data;

BiNode *lchild,*rchild;

};

 

class Tree

{

public:

Tree(){root=Create(root);}

~Tree(){Release(root);}

void PreOrder(){PreOrder(root);}

void InOrder(){InOrder(root);}

void PostOrder(){PostOrder(root);}

private:

BiNode *root;

BiNode *Create(BiNode *T);

void Release(BiNode *T);

void PreOrder(BiNode *T);

void InOrder(BiNode *T);

void PostOrder(BiNode *T);

};

#endif

 

#include<iostream>

using namespace std;

#include"Tree.h"

 

BiNode *Tree::Create(BiNode *T)

{

char ch;

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

cin>>ch;

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

else

{

T=new BiNode;

T->data=ch;

T->lchild=Create(T->lchild);

T->rchild=Create(T->rchild);

}

return T;

}

 

void Tree::Release(BiNode *T)

{

if(T!=NULL)

{

Release(T->lchild);

Release(T->rchild);

delete T;

}

}

 

void Tree::PreOrder(BiNode *T)

{

if(T==NULL) return;

else

{

cout<<T->data<<" ";

PreOrder(T->lchild);

PreOrder(T->rchild);

}

}

void Tree::InOrder(BiNode *T)

{

if(T==NULL) return;

else

{

InOrder(T->lchild);

cout<<T->data<<" ";

InOrder(T->rchild);

}

}

 

void Tree::PostOrder(BiNode *T)

{

if(T==NULL) return;

{

PostOrder(T->lchild);

PostOrder(T->rchild);

cout<<T->data<<" ";

}

}

 

#include<iostream>

using namespace std;

#include "Tree.h"

 

int main()

{

Tree L;

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

L.PreOrder();

cout<<endl;

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

L.InOrder();

cout<<endl;

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

L.PostOrder();

cout<<endl;

return 0;

}