线性表链式储存

#include <stdbool.h>
#define NULL 0
typedef struct LNode *PtrToLNode;
typedef int ElementType;
struct LNode {
	ElementType Data;
	PtrToLNode Next;
};

typedef PtrToLNode Position;
typedef PtrToLNode List;

#define ERROR NULL;

Position FindKth(int X, List L) {
//按位查找
	List p = L;
	int i = 1;
	while (p!=NULL&&i<X)
	{
		p = p->Next;
		i++;
	}
	if (i == X)return p;	//找到第X项并返回指针
	else return NULL;
}
Position Find(List L, ElementType X) {
	//按值查找
	Position p = L;	//p为L头指针
	while (p&&p->Data != X)
		p->Next;
	return p;
}

bool insert(List L, ElementType X, Position P) {
	//在P之前插入新节点X
	Position tmp, pre;
	for (pre = L; pre&&pre->Next != P; pre = pre->Next);
	if (pre == NULL) {
		printf("插入位置参数错误");
		return false;
	}
	else {
		tmp = (Position)malloc(sizeof(struct LNode));
		tmp->Data = X;
		tmp->Next = P;
		pre->Next = tmp;
		return true;
	}	
}

bool Delete(List L, Position P) {
	//P是拟删除节点指针
	Position tmp, pre;
	for (pre = L; pre&&pre->Next != P; pre = pre->Next);
	if (pre == NULL || P == NULL) {
		printf("删除节点参数错误\n");
		return false;
	}
	else {
		pre->Next = P->Next;
		free(P);
		return true;
	}
}

//返回链表长度
int Length(List L) {
	List p = L;
	int j = 0;
	while (p) {
		p = p->Next;
		j++;
	}
	return j;
}