数据结构单链表实现插入删除查找

///////////list3.c实现链表的插入删除查找#include<stdio.h>#include<malloc.h>#include<stdlib.h>typedef struct LNode //////////定义数据结构体{ int num; char name[20]; struct LNode* next;}*Link; ///////////定义一个指针类型typedef struct{ Link head,tail; int len;}LinkList;LinkList *gList;void MenuInfo();void InputData(LinkList *mList);void OutputData(LinkList *mList);void InsertData(LinkList *mList,int n);Link SearchNode(LinkList *mList,int n);void DeleteData(LinkList *mList,int n);void main(){ int _choice; int _quit=0; int n=0; gList=(LinkList *)malloc(sizeof(LinkList)); gList->head=gList->tail=NULL; do { MenuInfo(); scanf("%d",&_choice); switch(_choice) { case 1:InputData(gList);break; case 2:OutputData(gList);break; case 3:printf("insert number/n");scanf("%d",&n);InsertData(gList,n);break; case 4:printf("insert number/n");scanf("%d",&n);DeleteData(gList,n);break; default :_quit=1;break; } }while(!_quit);}void MenuInfo(){ printf("**************************************/n"); printf("1~input data /n"); printf("2~output data /n"); printf("3~insert data /n"); printf("4~delete data /n"); printf("-1~quit /n"); printf("**************************************/n"); printf("please select:/n");}void InputData(LinkList *mList){ Link _link; while(1) { _link=(Link)malloc(sizeof(struct LNode)); scanf("%d,%s",&_link->num,_link->name); _link->next=NULL; if(_link->num==-1) break; if(mList->head==NULL) { mList->tail=mList->head=_link; } else { mList->tail->next=_link; mList->tail=_link; } if(mList->len!=0) mList->len=0; else mList->len++; }}void OutputData(LinkList *mList){ Link _link=mList->head; if(_link==NULL) { printf("list is empty!/n"); } do { printf("num:[%d],name[%s]/n",_link->num,_link->name); _link=_link->next; }while(_link);}void InsertData(LinkList *mList,int n){ Link tLink; Link _link; tLink=SearchNode(mList,n); if(tLink==NULL) printf("Node is NULL/n"); else { _link=(Link)malloc(sizeof(struct LNode)); scanf("%d,%s",&_link->num,_link->name); _link->next=tLink->next; tLink->next=_link; }}Link SearchNode(LinkList *mList,int n){ Link _link=mList->head; if(_link==NULL) return NULL; do { if(_link->num==n) return _link; else _link=_link->next; }while(_link); return NULL;}void DeleteData(LinkList *mList,int n){ Link _link=mList->head; Link _linkp=mList->head; if(_link==NULL) printf("Node is NULL/n"); else { while(1) { if(_link->num==n) { if(_link==mList->head) { mList->head=_link->next; _link->next=NULL; free(_link); break;if(_link->next==NULL) { mList->tail=_linkp; _linkp->next=NULL; free(_link); break; } _linkp->next=_link->next; _link->next=NULL; free(_link); break; } else { _linkp=_link; _link=_link->next; } } }}

数据结构单链表实现插入删除查找