单链表c语言版,单链表与顺序表的实现（C语言版）

这两个(单链表和顺序表)的实现方法可以说是最精辟和最容易理解了，而且很完善，很通用！

typedef struct node{

EleType data;

struct node *next;

}ChainNode;

typedef struct{

ChainNode *head;

ChainNode *tail;

}List;

List * CreateList();

void DestoryList(List *);

void ClearList(List *);

int ListAppend(List *,EleType);

int ListInsert(List *,int,EleType);

int ListDelete(List *,int);

int GetElement(List *,int,EleType *);

int TraverseList(List *,int (*)(EleType *));

ChainNode * GetAddr(List *,int);

ChainNode * NewChainNode(EleType);

List * CreateList()

{

List *p;

EleType *data = 0;

p = (List *)malloc(sizeof(List));

if(!p)

{

return 0;

}

p->head = NewChainNode(*data);

p->tail = p->head;

if(!p->head)

{

free(p);

return 0;

}

return p;

}

void DestoryList(List *lp)

{

ClearList(lp);

free(lp->head);

free(lp);

}

void ClearList(List *lp)

{

while(ListDelete(lp,1));

}

int ListAppend(List *lp,EleType data)

{

ChainNode *newp;

newp = NewChainNode(data);

if(!newp)

return 0;

lp->tail->next = newp;

lp->tail = newp;

return 1;

}

int ListInsert(List *lp,int n,EleType data)

{

ChainNode *p;

ChainNode *newp;

p = GetAddr(lp,n-1);

if(!p)

return 0;

newp = NewChainNode(data);

if(!newp)

return 0;

newp->next = p->next;

p->next = newp;

if(!newp->next)

lp->tail = newp;

return 1;

}

int ListDelete(List *lp,int n)

{

ChainNode *p;

ChainNode *p1;

if(!lp->head->next)

return 0;

p=GetAddr(lp,n-1);

if(!p)

return 0;

p1 = GetAddr(lp,n);

if(!p1)

return 0;

p->next = p1->next;

if(!p->next)

lp->tail = p;

free(p1);

return 1;

}

int GetElement(List *lp,int n,EleType *data)

{

ChainNode *p;

p = GetAddr(lp,n);

if(!p)

return 0;

*data = p->data;

return 1;

}

int TraverseList(List *lp,int(* f)(EleType *))

{

ChainNode *p;

int a = 0;

for(p=lp->head->next;p;p=p->next)

{

if(!f(&(p->data)))

return a+1;

a++;

}

return 0;

}

ChainNode * NewChainNode(EleType data)

{

ChainNode *p;

p = (ChainNode *)malloc(sizeof(ChainNode));

if(!p)

return 0;

p->data = data;

p->next = 0;

return p;

}

ChainNode * GetAddr(List *lp,int n)

{

ChainNode *p;

int a;

if(n<0)

return 0;

p = lp->head;

a=0;

while(p&&a

{

p=p->next;

a++;

}

return p;

}

详见附件！