单链表c语言实现

#include <stdio.h>
#include <stdlib.h>
typedef int Status;
typedef int ElemType;
//定义链表类型 
typedef struct LNode{
	ElemType data;
	struct LNode *next;
}LNode, *Linklist;
//初始化一个链表 
Status Init_LNode(Linklist &L) {   
	L = (LNode*)malloc(sizeof(LNode));
	if(!L) return 0;
	L->next = NULL;
	return 1;
}
//查找第i个结点并用e返回 
Status GetElem_LNode(Linklist &L, int i, ElemType &e) {
	Linklist p = L->next;
	int j = 1;
	while(p && j < i) {
		p = p->next;
		j++;
	}
	if(!p || j > i) return 0;
	e = p->data;
	return 1;
}
//插入结点 
Status Insert_LNode(Linklist &L, int i, ElemType e) {
	Linklist s = (Linklist)malloc(sizeof(LNode)); 
	if(!s) return 0;
	Linklist p = L;
	int j = 0;
	while(p && j < i - 1) {
		p = p->next;
		++j;
	}
	if(!p || j > i - 1) return 0;
	s->data = e;
	s->next = p->next;
	p->next = s;
	return 1;
} 
//删除结点 
Status Delete_LNode(Linklist &L, int i, ElemType &e) {
	Linklist p = L;
	int j = 0;
	while(p && j < i - 1) {
		p = p->next;
		++j;
	}
	if(!(p->next) || j > i - 1) return 1;
	Linklist q = p->next;
	p->next = q->next;
	e = q->data;
	free(q);
	return 1;
} 
//遍历单链表 
Status Traverse_LNode(Linklist &L) {
	Linklist p;	
	for(p = L->next; p; p = p->next) {
		printf("%d", p->data);
	}
	return 1;
} 
//头插法
Status CreateReverse_LNode(Linklist &L, int n) {	
	for(int i = 1; i <= n; i++) {
		Linklist s = (Linklist)malloc(sizeof(LNode));
		if(!s) return 0;
		s->next = NULL;
		Linklist p = L;
		ElemType e;
		printf("请输入第%d个数据：", i);
		scanf("%d", &e);
		s->data = e;
		s->next = p->next;
		p->next = s;
	}
	return 1;
} 
//尾插法
Status Create_LNode(Linklist &L, int n) {
	Linklist p = L;
	for(int i = 1; i <= n; i++) {
		Linklist s = (Linklist)malloc(sizeof(LNode));
		if(!s) return 0;
		s->next = NULL;		
		ElemType e;
		printf("请输入第%d个数据：", i);
		scanf("%d", &e);
		s->data = e;
		p->next = s;
		p = s;
	}
	return 1;
}
//就地逆转
Status Reverse_LNode(Linklist &L) {
	Linklist p, q, s;
	p = L->next;
	q = p->next;
	s = q->next;
	p->next = NULL;
	while(s->next) {
		q->next = p;
		p = q;
		q = s;
		s = s->next;
	} 
	q->next = p;
	s->next = q;
	L->next = s;
	return 1;
}
int main(void) {
	Linklist L;
	Init_LNode(L);

	Create_LNode(L, 5);
	Traverse_LNode(L);
	printf("\n"); 
	Reverse_LNode(L);
	Traverse_LNode(L);
	return 0;
}