1线性表链表.docVIP

单链表操作验证 #include stdio.h #define NULL 0 typedef struct LNode {int data; struct LNode *next; }LNode, *Linklist; main() { char menu(void); Linklist Creat(); void Insert(Linklist L, int i, int e); void Delete(Linklist L, int i); int LocatElem(Linklist L, int e); int Length(Linklist L); void Inversion (Linklist L); void Print(Linklist L); int i,x,n,k,flag=1; char ch; Linklist head=NULL; do{ ch=menu(); switch (ch) {case 1: printf(Input numbers to creat list (end by 0):); head=Creat();Print(head); getch(); break; case 2: printf(Input location to insert before i, i=); scanf(%d,i); printf(Input a number to insert x, x=); scanf(%d,x); Insert(head, i, x);Print(head); getch(); break; case 3: printf(Input a location to delete i, i=); scanf(%d,i); Delete(head,i);Print(head); break; case 4: n=Length(head); printf(The length of the Linklist is %d\n,n);Print(head); getch(); break; case 5: printf(Input a location to find x, x=); scanf(%d,x); i=LocatElem(head,x); if(i) {printf(The location of %d is %d\n,x,i);Print(head);} getch(); break; case 6: Inversion(head); Print(head);getch(); break; case 7: Print(head);getch(); break; case 0: flag=0; } }while(flag==1); } char menu(void) { char ch;clrscr(); printf(\n\n); printf( MENU \n); printf( =================================================\n); printf( Linklist oper