单链表的增删查改

#define _CRT_SECURE_NO_WARNINGS

#include <stdio.h>
#include <stdlib.h>

typedef int elemtype;
typedef struct Lnode {
	elemtype data;
	struct Lnode* next;
}Lnode,*Linklist;//定义链表结点

void Headin(Linklist &L) {
	Lnode* s; int x;
	L = (Linklist)malloc(sizeof(Lnode));
	L->next = NULL;
	scanf("%d", &x);
	while (x != 9999) {
		s= (Lnode*)malloc(sizeof(Lnode));
		s->data = x;
		s->next = L->next;
		L->next = s;
		scanf("%d", &x);
	}
}//头插法函数
void Printlist(Linklist L) {
	L = L->next;
	while (L != NULL) {
		printf("%3d", L->data);
		L = L->next;
	}
	printf("\n");
}//打印链表
void Tailin(Linklist& L) {
	Lnode* p,*q;
	int x;
	L = (Linklist)malloc(sizeof(Lnode));
	L->next = NULL;
	q = L;
	scanf("%d", &x);
	while (x != 9999) {
		p = (Lnode*)malloc(sizeof(Lnode));
		p->data = x;
		q->next = p;
		p->next = NULL;
		q = p;
		scanf("%d", &x);
	}
	q->next = NULL;
}//尾插法函数,q指向表尾节点
Lnode* Getelem(Linklist L, int i) {
	Lnode* p = L->next;
	if (0 == i) {
		return L;
	}
	if (i < 0) {
		return NULL;
	}
	int j = 1;
	while (p && j <i) {
		p=p->next;
		j++;
	}
	return p;
}//查询指定位置元素
Lnode* Locatelem(Linklist L, elemtype e) {
	Lnode* p = L->next;
	while (p && p->data != e) {
		p = p->next;
	}
	return p;
}//按值查找元素
void Listfrontinsert(Linklist L, int i, elemtype e) {
	Lnode* p = Getelem(L, i-1);
	Lnode* s = (Lnode*)malloc(sizeof(Lnode));
	s->data = e;
	s->next = p->next;
	p->next = s;
}//链表的插入
bool Listdelet(Linklist L, int i) {
	Lnode* p, * q;
	p = Getelem(L, i-1);
	q = Getelem(L, i);
	if (NULL == p) {
		return false;
	}
	p->next = q->next;
	free(q);
	return true;
}//删除指定位置节点
int main() {
	Linklist L;
	//Headin(L);
	Tailin(L);
	Printlist(L);
	Getelem(L, 3);
	//Lnode* search=Getelem(L,3);
	//if (search != NULL) {
	//	printf("已找到指定元素，值为%d", search->data);
	//}
	//search = Locatelem(L, 5);
	//if (search != NULL) {
	//	printf("已找到指定元素，位置为%d", search->data);
	//}
	Listfrontinsert(L, 2, 99);
	Printlist(L);
	Listdelet(L, 2);
	Printlist(L);
	return 0;
}