数据结构c语言版单链表源代码

1、/* 单链表的各种操作*/#include <>#include <>#define null 0typedef int ElemType; /* 字符型数据*/struct LNodeElemType data;struct LNode *next;void setnull(struct LNode *p);int length (struct LNode *p);ElemType get(struct LNode *p,int i);void insert(struct LNode *p,ElemType x,int i);void dele(struct LNod

2、e *p,int i);void display(struct LNode *p);int locate(struct LNode *p,ElemType x);void main()定义静态变量*/struct LNode *head,*q; /* int select,x1,x2,x3,x4;int i,n;int m,g;char e,y;setnull(&head); /* 建设链表并设置为空表*/printf(" 请输入数据长度: ");scanf("%d",&n);for(i=1;i<=n;i+)将数据插入到单链表中pr

3、intf(scanf("%d",&y);insert(&head,y,i); /* 插入数据到链表display(&head);printf("select 1printf("select 2printf("select 3printf("select 4printf("select 0);*/* 显示链表所有数据*/求长度length()n");取结点get()n");求值查找locate()n");删除结点delete()n");退出 n");pr

4、intf("input your select: ");scanf("%d",&select);while(select!=0)switch(select)case 1:x1=length(&head);printf(" 输出单链表的长度%d ",x1);display(&head);break;case 2:printf(" 请输入要取得结点: ");scanf("%d",&m);x2=get(&head,m);printf("%d"

5、,x2);display(&head);break;case 3:printf(" 请输入要查找的数据: ");scanf("%d",&e);x3=locate(&head,e);printf("%d",x3);display(&head);break;case 4: printf(" 请输入要删除的结点: ");scanf("%d",&g);dele(&head,g);display(&head);break;printf("s

6、elect 1 求长度 length()n");printf("select 2 取结点 get()n");printf("select 3求值查找locate()n");printf("select 4删除结点delete()n");printf("select 0 退出 n");printf("input your select: ");scanf("%d",&select);void setnull(struct LNode *p)*p=null;in

7、t length (struct LNode *p)int n=0;struct LNode *q=*p;while (q!=null)n+;q=q->next;return(n);ElemType get(struct LNode *p,int i)int j=1;struct LNode *q=*p;while (j<i&&q!=null)q=q->next;j+;if(q!=null)return(q->data);elseprintf(" 位置参数不正确!n");return 0;int locate(struct LNode

8、 *p,ElemType x)int n=0;struct LNode *q=*p;while (q!=null&&q->data!=x)q=q->next;n+;if(q=null)return(-1);elsereturn(n+1);void insert(struct LNode *p,ElemType x,int i)int j=1;struct LNode *s,*q;s=(struct LNode *)malloc(sizeof(struct LNode);s->data=x;q=*p;if(i=1)s->next=q;*p=s;elsewh

9、ile(j<i-1&&q->next!=null)q=q->next;j+;if(j=i-1)s->next=q->next;q->next=s;elseprintf(" 位置参数不正确!n");void dele(struct LNode *p,int i)int j=1;struct LNode *q=*p,*t;if(i=1)t=q;*p=q->next;elsewhile(j<i-1&&q->next!=null)q=q->next;j+;if(q->next!=null&&j=i-1)t=q->next;q->next=t->next;elseprintf(" 位置参数不正确!n");if(t!=null)free(t); void display(struct LNode *p) struct LNode *q;q=*p;printf(" 单链表显示: ");if(q=null)printf(" 链表为空!");else if (q->next=null)printf("%d