1.顺序表
typedef struct Sqlist
{
int elem[SIZE];
int length;
}Sqlist,*PSqlist;
bool IsFull(PSqlist Psq);
bool IsEmpty(PSqlist Psq);
void InitSqlist(PSqlist Psq);
bool Insert(PSqlist Psq, int pos, int val);
int Search(PSqlist Psq, int pos, int key);
bool DeletePos(PSqlist Psq, int pos, int *rtv);
bool Delete(PSqlist Psq, int pos, int key);
bool GetElem(PSqlist Psq, int pos, int *rtv);
int GetLength(PSqlist Psq);
void Clear(PSqlist Psq);
void Destory(PSqlist Psq);
void Show(PSqlist Psq);
2.单链表
typedef struct Node
{
int data;
struct Node * next;
}Node,*List;
void InitList(List plist);
bool Insert_head(List plist, int val);
bool Insert_tail(List plist, int val);
bool Insert_pos(List plist, int pos, int val);
Node *Search_pre(List plist, int key);
bool Delete(List plist, int key);
bool IsEmpty(List plist);
void Destroy(List plist);
int GetLength(List plist);
void Show(List plist);
void List_reserve(List plist);