数据结构实验前要.pdf

《数据结构》实验（一） 实验目的：复习C语言知识，为后续课程编程环节打下基础。 实验课时：4课时 实验内容： 头文件： #define DATATYPE1 int #define DATATYPE2 char #define KEYTYPE int #define MAXSIZE 100 #define MAXLEN 40 #define VEXTYPE int #define ADJTYPE int typedef struct { DATATYPE1 datas[MAXSIZE]; int last; }SEQUENLIST; typedef struct node { DATATYPE2 data; struct node *next; }LINKLIST; typedef struct dnode {DATATYPE2 data; struct dnode *prior, *next; } DLINKLIST; typedef struct { DATATYPE1 data[MAXSIZE]; int top; }SEQSTACK; typedef struct snode { DATATYPE2 data; struct snode *next; }LINKSTACK; typedef struct { DATATYPE1 data[MAXSIZE]; int front, rear; }SEQQUEUE; typedef struct qnode { DATATYPE1 data; struct qnode *next; }LINKQLIST; typedef struct { LINKQLIST *front, *rear; }LINKQUEUE; typedef struct { char ch[MAXSIZE]; int len; }SEQSTRING; typedef struct { char *ch; int len; } HSTRING; typedef struct { int i, j; DATATYPE1 v; }NODE; typedef struct { int m, n, t; NODE data[MAXLEN]; }SPMATRIX; typedef struct { DATATYPE2 bt[MAXSIZE]; int btnum; }BTSEQ; typedef struct node1 { DATATYPE2 data; struct node1 *lchild, *rchild; }BTCHINALR; typedef struct node2 { DATATYPE2 data; struct node2 *lchild, *rchild, *parent; }BTCHINALRP; typedef struct { DATATYPE2 data; int parent; }PTNODE; typedef struct { PTNODE nodes[MAXSIZE]; int nodenum; }PTTREE; typedef struct cnode { int child; struct cnode *next; }CHILDLINK; typedef struct { DATATYPE2 data; CHILDLINK *headptr; }CTNODE; typedef struct {CTNODE nodes[MAXSIZE]; int nodenum, rootset; }CTTREE; typedef