数据结构实验线性表保存多个链表.docVIP

/* Lin ear Table On Seque nee Structure */ #include stdio.h #inelude malloc.h #inelude stdlib.h /* page 10 on textbook */ #defineTRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define INFEASTABLE-1 #define OVERFLOW -2 #define LIST_INIT_SIZE 50 typedef int status; 〃数据元索类型定义 typedef struct TEIemType{ int e;〃关键字 char c;〃需返回的信息 }TEIemType; typedef struct BiTNode{ TEIemType data; struct BiTNode *lchild;//左孩了指针 struct BiTNode *rchild;//右孩子指针 }BiTNode,*BiTree; typedef struct{ int name; BiTNode *head; jElemType; typedef struct{ ElemType * elem; int length; int listsize; JSqList; page 19 on textbook * status lnitBiTree(SqList T);//casel status DestroyBiTreefSqList T);//case2 status CreatBiTree(SqListjdefinition);//case 3 status ClearBiTree(SqList T);//case 4 status BiTreeEmpty(SqList T);//case 5 int BiTreeDepth(SqList T);//case 6 status Root(SqList T);//case 7 status ValuefSqList 7；TEIemType e); //case 8 status Assign(SqList ETEIemType e，value);//case 9 status Parent(SqList XTEIemType e);//case 10 status LeftChildfSqList ETEIemType e);//case 11 status RightChild(SqList TJEIemType e);//case 12 status LeftSibling(SqList XTEIemType e);//case 13 status RightSibling(SqList TTEIemType e);//case 14 status lnsertChild(Sqlist T,BiTree p,int LR,BiTNode c);//case 15 status DeleteChild(SqList TBiTree p,int LR);//case 16 status PreOrderTraverse(SqList T);//case 17 status InOrderTraverse(SqList T);//case 18 status PostOrderTraverse(SqList T);//case 19 status LevelOrderTraverse(SqList);//case 20 /* * / int main(void){ SqList L; L.elem=NULL; int op=l,i,n; int 巳cui;pre_c，next_c; L.elem = (ElemType *)malloc( LIST_INIT_SIZE * sizeof (ElemType)); if(!L.elem) exit(OVERFLOW); L.length=0; L.listsize=UST INIT SIZE; while(op){ system(cls); printfCW); prin tf( Menu for Lin ear Table On Sequence Structure \n); printf(1. InitBiTreeprintff printf( 1. InitBiTree printff 2. DestroyBiTree printf( 3. CreateBiTree printf( 4. ClearBiTree printf( 5. BiTreeEmpty printff 6. BiTreeDepth printf( 7. Root prin