数据结构C语言版 广义表的头尾链表存储表示(国外英文资料).docVIP

数据结构C语言版 广义表的头尾链表存储表示(国外英文资料) Data structure C language version of the generalized table of the head and tail chain store, indicating.Txt * Data structure C language version of the generalized table of the head and tail chain memory representation P109 Compile environment: Dev-C++ 4.9.9.2 Date: February 13, 2011 * / #include stdio.h #include malloc.h #include stdlib.h #include string.h Typedef char AtomType; / / define atomic type of character Typedef enum{ ATOM / ATOM==0: atom LIST / LIST==1: sub table } ElemTag; / / generalized list Touwei chain store said Typedef struct GLNode { ElemTag tag; / / the public part, used to distinguish between atomic nodes and node table The joint part of union / atomic nodes and node table { AtomType atom; / / atom is a range of atomic nodes, the AtomType defined by the user Struct { Struct, GLNode, *hp, *tp; }ptr; / / PTR is a pointer table domain node, prt.hp and ptr.tp respectively to the header and footer }a; *GList GLNode;}, / / generalized list type / / create empty generalized list L Int InitGList (GList *L) { *L = NULL; Return 1; } The destruction of L / / generalized list Void DestroyGList (GList *L) { GList, Q1, q2; If (*L) { If ((*L) -tag = = ATOM) { Free (*L); / / delete atomic node *L = NULL; } Else / / is table node, you should delete the header and footer node { Q1 = (*L) -a.ptr.hp; Q2 = (*L) -a.ptr.tp; Free (*L); *L = NULL; / / a recursive delete header and footer node DestroyGList (q1); DestroyGList (q2); } } } 5.6 / / P115 algorithm The head and tail / list storage structure, L replication by generalized list generalized list T. Int CopyGList (GList, *T, GList, L) { If (L!) / / copy is empty, empty table *T = NULL; Else { *T = (GList) malloc (sizeof (GLNode)); / / create table node If (... *T) Exit (0); (*T) -tag = L-tag; If (L-tag = ATOM) (*T) -a.atom = L-a.atom; / / copy single atom Else / / is in turn table node, copy the header and footer { A copy of a copy of T-ptr.hp / L-ptr.hp generalized list CopyGList ( ((