c++编写的二叉树遍历程序

#include<iostream.h> #define max 50 struct node { char data; node *left,*right; int ltag,rtag; }; void creat(node * &head,char st1[]) { node *stt[max],*p; int top=-1,k,j=0; char m; head=NULL; m=st1[j]; while(m!='\0') { if(m=='(') { top++; stt[top]=p; k=1; } else if(m==')') { top--; } else if(m==',') { k=2; } else { p=new node; p->data=m; p->ltag=0; p->rtag=0; p->left=NULL; p->right=NULL; if(head==NULL) { head=p; } else { if(k==1) { stt[top]->left=p; } if(k==2) { stt[top]->right=p; } } } j++; m=st1[j]; } } void creattree(node * &head) { //root=NULL; node *p,*q; p=head; q=NULL; node *stt1[max]; int top=-1; while(1) { while(p!=NULL) { top++; stt1[top]=p; p=p->left; } if(top<0) { return; } else { p=stt1[top]; top--; if(q!=NULL) { if(q->right==NULL) { q->rtag=1; q->right=p; } if(p->left==NULL) { p->ltag=1; p->left=q; } } q=p; p=p->right; } } } void disp(node * &head) { if(head->ltag==0) { disp(head->left); } if(head->rtag==0) { disp(head->right); } cout<<head->data<<endl; } void main() { node *head; char tr[max]; cout<<"输入广义表表达式："; cin>>tr; creat(head,tr); //qingling(head); cout<<89; creattree(head); cout<<4545; cout<<head->ltag<<","<<head->rtag; // disp(head); }