广义表-（没有测试过）

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


typedef int AtomType;
//普通存储结构
typedef struct {
int tag;
union{
AtomType atom;
struct {
struct GLNode *head, *tail;
}LNode;
}atom_LNode;
}GLNode, *GList;


/*
//可扩展的存储结构
typedef struct GLNode {
int tag;
union {
AtomType atom;
struct GLNode *head;
}atom_LNode;
struct GLNode *tail;
}GLNode, *GList;;
*/
GList LSHead(); //求广义表的表头
GList LSTail(); //求广义表的表尾
int LSLength(); //求广义表的长度
int LSDepth(); //求广义表的深度
int CountAtom(); //求广义表中的原子个数
int LSCopy(); //复制广义表


void main () {
GList a = (GList)malloc(sizeof(GLNode));
a->atom_LNode.LNode.tail = NULL;
printf("%d",a->atom_LNode.LNode.tail);


}




GList LSHHead (GList l) {
if (l == NULL)
return NULL;
if (l->tag == 0)
exit(0);
else 
return (l->atom_LNode.LNode.head);
}


GList LSTail (GList l) {
if (l == NULL) 
return NULL;
if (l->tag == 0)
exit(0);
else 
return (l->atom_LNode.LNode.tail);
}


int LSLength (GList l) {
int len = 0;
GLNode *p;
if (l == NULL)
return 0;
if (l->tag == 0)
exit(0);
p = l;
while (p) {
len++;
p = p->atom_LNode.LNode.tail;
}
return len;
}


int LSDepth (GList l) {
int d, max = 1;
GLNode *p;
if (l == NULL) 
return 1;
if (l->tag == 0) 
return 0;
p = l;
while (p) {
d = LSDepth(p->atom_LNode.LNode.head);
if (d > max)
max = d;
p = p->atom_LNode.LNode.tail;
}
return max+1;
}


int CountAtom (GList l) {
if (l == NULL)
return 0;
if (l->tag == NULL) 
return 1;
return (CountAtom(l->atom_LNode.LNode.head) + CountAtom(l->atom_LNode.LNode.tail));
}


int LSCopy (GList l, GList *LCopy) {
if (l == NULL) {
*LCopy = NULL;
return 1;
}
*LCopy = (GList)malloc(sizeof(GLNode));
if (*LCopy == NULL) 
return 0;
(*LCopy)->tag = l->tag;
if (l->tag == 0)
(*LCopy)->atom_LNode.atom = l->atom_LNode.atom;
else {
LSCopy(l->atom_LNode.LNode.head, &((*LCopy)->atom_LNode.LNode.head));
LSCopy(l->atom_LNode.LNode.tail, &((*LCopy)->atom_LNode.LNode.tail));
}
}