用C++实现的基于链表的线性表,有头结点.
实现的基本操作有创建空链表,插入,删除,查找等操作.
#include <stdio.h>
#include <stdlib.h>
#define ERROR NULL
typedef int ElementType;
typedef struct LNode *PtrToLNode;
struct LNode {
ElementType Data;
PtrToLNode Next;
};
typedef PtrToLNode Position;
typedef PtrToLNode List;
List MakeEmpty();//创建并返回一个空的线性表
Position FindPrevious(List L, Position P);//
Position Find(List L, ElementType X);//返回线性表中X的位置。若找不到则返回ERROR
bool Insert(List L, ElementType X, Position P);//将X插入在位置P指向的结点之前,返回true。如果参数P指向非法位置,返回false
bool Delete(List L, Position P);//将位置P的元素删除并返回true。若参数P指向非法位置,并返回false。
List MakeEmpty() {
List L;
L = (List)malloc(sizeof(struct LNode));
L->Data = NULL;
L->Next = NULL;
return L;
}
Position FindPrevious(List L, Position P) {
Position findprev = L;
while (findprev&&findprev->Next != P) {
findprev = findprev->Next;
}
if (findprev) {
return findprev;
}
else {
return ERROR;
}
}
Position Find(List L, ElementType X) {
Position find = L->Next;
while (find&&find->Data != X) {
find = find->Next;
}
if (find) {
return find;
}
else {
return ERROR;
}
}
bool Insert(List L, ElementType X, Position P) {
Position findprev = FindPrevious(L, P);
if (findprev) {
Position Temp = (Position)malloc(sizeof(struct LNode));
Temp->Data = X;
Temp->Next = P;
findprev->Next = Temp;
return true;
}
else {
return false;
}
}
bool Delete(List L, Position P) {
Position findprev = FindPrevious(L, P);
if (findprev) {
findprev->Next = P->Next;
free(P);
return true;
}
else {
return false;
}
}