#include <iostream.h>
struct BintrNode
{
char value;
BintrNode* lf;
BintrNode* rt;
};
void init(BintrNode* &p)
{
char ch;
cin>>ch;
if(ch!='!')
{
p=new BintrNode;
p->value=ch;
init(p->lf);
init(p->rt);
}
else
{
p=NULL;
}
}
void pre(BintrNode* p)
{
if(p)
{
cout<<p->value;
pre(p->lf);
pre(p->rt);
}
}
void ino(BintrNode* p)
{
if(p)
{
ino(p->lf);
cout<<p->value;
ino(p->rt);
}
}
void pro(BintrNode* p)
{
if(p)
{
pro(p->lf);
pro(p->rt);
cout<<p->value;
}
}
void main()
{
BintrNode* bt;
init(bt);
pre(bt);
cout<<endl;
ino(bt);
cout<<endl;
pro(bt);
cout<<endl;
}
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *lh,*rh;
int ltag,rtag;
}*pr,*t,*s[30];
struct node* creat()
{
struct node *t,*q;
int i,x,j;
printf("i,x=");
scanf("%d%d",&i,&x);
while((i!=0)&&(x!=0))
{
q=(struct node *)malloc(sizeof(struct node));
q->data=x;
q->lh=NULL;
q->rh=NULL;
s[i ]=q;
if(i==1)
t=q;
else
{
j=i/2;
if((i%2)==0)
s[j]->lh=q;
else
s[j]->rh=q;
}
printf("i,x=");
scanf("%d%d",&i,&x);
}
return(t);
}
/*void inthread(struct node *p) //閫掑綊綆楁硶
{
if(p!=NULL)
{
inthread(p->lh);
printf("%6d\t",p->data);
if(p->lh!=NULL)
p->ltag=0;
else
{
p->ltag=1;
p->lh=pr;
} //寤虹珛P鑺傜偣鐨勫乏綰跨儲錛屾寚鍚戝墠瓚嬭妭鐐筆R
if(pr!=NULL)
{
if(pr->rh!=NULL)
pr->rtag=0;
else
{
pr->rtag=1;
pr->rh=p;
}//鍓嶈秼鑺傜偣PR寤虹珛宸︾嚎绱紝鎸囧悜鑺傜偣P
}
pr=p;//pr璺熶笂p,浠ヤ究p鍚戝悗縐誨姩
inthread(p->rh);
}
}*/
void inthread(struct node *t)//闈為掑綊綆楁硶
{
int top,bools;
struct node *p;
pr=NULL;p=t;top=0;bools=1;
do{
while(p!=NULL)
{
top++;
s[top]=p;
p=p->lh;
}
if(top==0)bools=0;
else
{
p=s[top];
top--;
printf("%6d",p->data);
if(p->lh!=NULL)
p->ltag=0;
else
{
p->ltag=1;
p->lh=pr;
} //寤虹珛P鑺傜偣鐨勫乏綰跨儲錛屾寚鍚戝墠瓚嬭妭鐐筆R
if(pr!=NULL)
{
if(pr->rh!=NULL)
pr->rtag=0;
else
{
pr->rtag=1;
pr->rh=p;
}//鍓嶈秼鑺傜偣PR寤虹珛宸︾嚎绱紝鎸囧悜鑺傜偣P
}
pr=p;//pr璺熶笂p,浠ヤ究p鍚戝悗縐誨姩
p=p->rh;
}//END else
}while(bools);
pr->rh=NULL;
}
main()
{
pr=NULL;
t=creat();
inthread(t);
pr->rh=NULL;
}
#include<stdio.h>
#include<malloc.h>
#include<iostream>
//瀹氫箟鑺傜偣
typedef struct BiNode{
char data;
struct BiNode *lch;
struct BiNode *rch;
}BiNode,*BiTree;
//鍏堝簭鎷撳睍搴忓垪寤虹珛浜屽弶鏍?
void Create(BiTree &T)
{
T =(BiNode*) malloc (sizeof(BiNode));
printf("Enter the data \n");
scanf(" %c",&T->data);
if(T->data=='#') T = NULL;
if(T){
printf("");
Create(T->lch);
Create(T->rch);
}
}
//鍏堝簭閬嶅巻 (閫掑綊)
void Preorder (BiTree T)
{
if (T) {
printf(" %c",T->data); // 璁塊棶鏍圭粨鐐?br>
Preorder(T->lch); // 閬嶅巻宸﹀瓙鏍?br> Preorder(T->rch);// 閬嶅巻鍙沖瓙鏍?br> }
}
//涓簭閬嶅巻 錛堥掑綊錛?br>void Inorder (BiTree T)
{
if(T) {
Inorder(T->lch);
printf(" %c",T->data);
Inorder(T->rch);
}
}
//鍚庡簭閬嶅巻 錛堥掑綊錛?br>void Postorder (BiTree T)
{
if(T) {
Postorder(T->lch);
Postorder(T->rch);
printf(" %c",T->data);
}
}
int main()
{
//寤烘爲
printf("The fuction Create() is called.\n");
BiTree T;
Create(T);
//涓夌閬嶅巻閫掑綊綆楁硶
printf("\n");
printf("The fuction Preorder() is called.\n");
Preorder(T);
printf("\n");
printf("The fuction Inorder() is called.\n");
Inorder(T);
printf("\n");
printf("The fuction Postorder() is called.\n");
Postorder(T);
printf("\n");
system("pause");
}
]]>