#include <iostream>
using namespace std;
typedef struct BiTNode
{
int data;
struct BiTNode* lchild, * rchild;
}BiTNode,*BiTree;
//先序遍历
void preOrder(BiTree T)
{
if (T != NULL) {
cout << T->data<<" ";
preOrder(T->lchild);
preOrder(T->rchild);
}
}
//中序遍历
void InOrder(BiTree T)
{
if (T != NULL) {
InOrder(T->lchild);
cout << T->data << " ";
InOrder(T->rchild);
}
}
//后序遍历
void postOrder(BiTree T)
{
if (T != NULL) {
postOrder(T->lchild);
postOrder(T->rchild);
cout << T->data << " ";
}
}
int main()
{
BiTNode* root = new BiTNode();
BiTree ro = root;
ro->data = 1;
BiTNode* l = new BiTNode();
ro->lchild = l;
l->data = 2;
BiTNode* lr = new BiTNode();
l->rchild = lr;
lr->data = 4;
BiTNode* lrl = new BiTNode();
lr->lchild = lrl;
lrl->data = 6;
BiTNode* r = new BiTNode();
ro->rchild = r;
r->data = 3;
BiTNode* rr = new BiTNode();
r->rchild = rr;
rr->data = 5;
BiTNode* a = new BiTNode();
l->lchild = a;
a->data = 9;
BiTNode* b = new BiTNode();
lr->rchild = b;
b->data = 7;
BiTNode* c = new BiTNode();
r->lchild = c;
c->data = 8;
cout<<"前序遍历";
preOrder(ro);
cout << endl;
cout<<"中序遍历";
InOrder(ro);
cout << endl;
cout<<"后序遍历";
postOrder(ro);
cout << endl;
return 0;
}