#include<iostream>
using namespace std;
struct BiNode
{
char data;
BiNode* lchild, * rchild;
};
class BiTree{
public:
BiTree(){root=create(root);}
~BiTree(){release(root);}
void PreOrder(){PreOrder(root);}
void InOrder(){InOrder(root);}
void PostOrder(){PostOrder(root);}
private:
BiNode *root;
BiNode *create(BiNode *bt);
void release(BiNode *bt);
void PreOrder(BiNode *bt);
void InOrder(BiNode *bt);
void PostOrder(BiNode *bt);
};
BiNode *BiTree::create(BiNode *bt)
{
char ch;
cout<<"please input the point-data of creating a bitree:"<<endl;
cin>>ch;
if(ch=='#')return NULL;
else{
bt=new BiNode;
bt->data=ch;
bt->lchild=create(bt->lchild);
bt->rchild=create(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 T;
cout<<"树"<<endl;
cout<<"----------前序遍历-----------"<<endl;
T.PreOrder();
cout<<endl;
cout<<"----------中序遍历-----------"<<endl;
T.InOrder();
cout<<endl;
cout<<"----------后序遍历-----------"<<endl;
T.PostOrder();
cout<<endl;
return 0;
using namespace std;
struct BiNode
{
char data;
BiNode* lchild, * rchild;
};
class BiTree{
public:
BiTree(){root=create(root);}
~BiTree(){release(root);}
void PreOrder(){PreOrder(root);}
void InOrder(){InOrder(root);}
void PostOrder(){PostOrder(root);}
private:
BiNode *root;
BiNode *create(BiNode *bt);
void release(BiNode *bt);
void PreOrder(BiNode *bt);
void InOrder(BiNode *bt);
void PostOrder(BiNode *bt);
};
BiNode *BiTree::create(BiNode *bt)
{
char ch;
cout<<"please input the point-data of creating a bitree:"<<endl;
cin>>ch;
if(ch=='#')return NULL;
else{
bt=new BiNode;
bt->data=ch;
bt->lchild=create(bt->lchild);
bt->rchild=create(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 T;
cout<<"树"<<endl;
cout<<"----------前序遍历-----------"<<endl;
T.PreOrder();
cout<<endl;
cout<<"----------中序遍历-----------"<<endl;
T.InOrder();
cout<<endl;
cout<<"----------后序遍历-----------"<<endl;
T.PostOrder();
cout<<endl;
return 0;
}