【数据结构】算法8.3 广义表遍历算法

#include<stdio.h>
#include<string.h>
#include<stdlib.h>

#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2

typedef int Status;
typedef int ElemType;

#define MAXSIZE 40
#define MAXSTRLEN 6 //最大字符串

typedef char SString[MAXSIZE+1];
typedef char AtomType;
typedef enum{ATOM,LIST}ElemTag;  //ATOM==0:原子，LIST==1：子表

typedef struct GLNode
{
    int mark;
    ElemTag tag;  //公共部分，用于区分原子结点和表结点
    union{    //原子结点和表结点的联合部分
        AtomType atom;    //atom是原子结点的值域
        struct{
            struct GLNode *hp,*tp;
        }ptr;  //ptr是表结点的指针域，ptr.hp和ptr.tp分别指向表头和表尾
    };
}GLNode,*GList;  //广义表eixing




/*******************************声明部分****************************************/
Status StrAssign(SString *T,char *chars);
int StrCompare(SString S,SString T);
int StrLength(SString S);
Status SubString(SString Sub, SString T,int pos,int len);
int StrEmpty(SString S);
Status StrCopy(SString T,SString S);
Status ClearString(SString S);
Status StrDelete(SString S,int pos,<