C中广义表的创建及深度求解.doc

C中广义表的创建及深度求解 #include#include#includetypedef char* ElemType;typedef struct GLnodeint tag;struct GLnode *tp;union char data; struct GLnode *hp;ptr;GList;void Server(char str,char hstr)/分离表头表尾int i=0,j=0,k=0,l=0,n;char *rstr;n=strlen(str);rstr=(char*)malloc(n+1)*sizeof(char);while(stri!=0&(stri!=,|k!=0) if(stri=() k+; else if(stri=) k-; if(stri!=,|stri=,&k!=0) hstrj=stri; j+; i+; hstrj=0;if(stri!=0)i+;while(stri!=0) rstrl=stri; l+; i+;rstrl=0;strcpy(str,rstr);free(rstr);GList*CreateGList(char str)/创建广义表GList *p,*q,*gl;char *subs,*hstr;int n;n=strlen(str);subs=(char*)malloc(n+1)*sizeof(char);hstr=(char*)malloc(n+1)*sizeof(char);if(n=0|strcmp(str,()=0) gl=NULL;else if(n=1) gl=(GList*)malloc(sizeof(GList); gl-tp=(GList*)malloc(sizeof(GList); gl-tag=0; gl-ptr.data; gl-tp=NULL;else gl=(GList*)malloc(sizeof(GList); gl-tag=1; p=gl; str+; strncpy(subs,str,n-2); subsn-2=0; do Server(subs,hstr); p-ptr.hp=CreateGList(hstr); q=p; n=strlen(subs); if(n0) p=(GList*)malloc(sizeof(GList); p-tag=1; q-tp=p; while(n0); q-tp=NULL;return(gl);int GListDepth(GList*gl)int p,q;if(gl=NULL) return(1);else if(gl-tag=0) return(0);else p=GListDepth(gl-ptr.hp); q=GListDepth(gl-tp); return(p+1q?p+1:q);int main()char str100;GList gl,*g;int n;g=≷scanf(%s,str);g=CreateGList(str);n=GListDepth(g)