5,6数据结构作业.docVIP

6.40 程序源代码： #includeiostream.h #includemalloc.h #includestdlib.h #define ok 1 #define error 0 #define null 0 typedef char elemtype; typedef int status; typedef struct ptree{ elemtype data; struct ptree *lchild,*rchild; struct ptree * parents; }ptree, *ptreelink; status creatt(ptreelink T,ptreelink p){ //中序创建树 elemtype ch; cout请输入结点值($表空)endl; cinch; if (ch==$) T=null; else { if(!(T=(ptreelink)malloc(sizeof(ptree)))) exit(-2); T-data=ch; T-parents=p; creatt(T-lchild,T); creatt(T-rchild,T); } return ok; } status visit(elemtype data){ coutdataendl; return ok; } status inordertraverse(ptreelink T){ ptreelink p,q; int tag,i=0,j; ptreelink pa[10]; if(!T-lchild) return error; else{ q=p=T-lchild; while(p!=T){ if(q) {p=q;q=q-lchild;tag=1;} else { if(tag==0) {p=p-parents;for(j=0;ji;j++) if(pa[j]==p) tag=1; if(tag==0) {pa[i]=p;i++;tag=1;} else tag=0; } else {if(!visit(p-data)) return error; q=p-rchild; tag=0; } } } } } void main(){ ptreelink T; //T为头结点，其左孩子为第一个有效结点 if(!(T=(ptreelink)malloc(sizeof(ptree)))) exit(-2); creatt(T-lchild,T); inordertraverse(T); } 运行结果： 6.48 程序源代码： #includeiostream.h #includemalloc.h #includestdlib.h #define ok 1 #define error 0 #define null 0 typedef char elemtype; typedef int status; typedef struct ptree{ elemtype data; struct ptree *lchild,*rchild; struct ptree * parents; }ptree, *ptreelink; #define stack_init_size 100 #define stackincrement 10 typedef struct ptree * selemtype; typedef struct { selemtype * base; selemtype * top; int stacksize; }stack; status initstack(stack s){ s.base=(struct ptree * *)malloc(stack_init_size*sizeof(selemtype)); if(!s.base ) exit(-2); s.top =s.base ; s.stacksize =stack_init_size; return ok; } status push(stack s,selemtype e){ if(s.top -s.base =s.stacksize ){ s.base=(struct ptree * *)realloc(s.base,(stackincrement+stack_init_size)*sizeof(se