数据结构单链表头文件“LinList.h”

#include "stdio.h"
#include "math.h"
typedef struct Node
{
DataType data;
struct Node *next;
}SLNode;
void ListInitiate(SLNode **head)
{
*head = (SLNode *)malloc(sizeof(SLNode));
(*head)->next = NULL;
}


int ListLength(SLNode *head)
{
SLNode *p = head;
int size = 0;
while(p->next !=NULL)
{
p = p->next;
size++;
}
return size;
}


int ListInsert(SLNode *head,int i,DataType x)
{
SLNode *p,*q;
int j;
p = head;
j = -1;
while(p->next !=NULL&&j<i-1)
{
p=p->next;
j++;
}
if(j!=i-1)
{
printf(" !");
return 0;
}
q=(SLNode *)malloc(sizeof(SLNode));
q->data=x;
q->next=p->next;
p->next=q;
return 1;
}


int ListDelete(SLNode *head,int i,DataType *x)
{
SLNode *p,*s;
int j;
p=head;
j=-1;
while(p->next!=NULL&&p->next->next!=NULL&&j<i-1)
{
p=p->next;
j++;
}
if(j!=i-1)
{
printf("   !");
return 0;
}
s=p->next;
*x=s->data;
p->next=p->next->next;
free(s);
return 1;
}


int ListGet(SLNode *head,int i,DataType *x)
{
SLNode *p;
int j;
p=head;
j=-1;
while(p->next!=NULL&&j<i)
{
p=p->next;
j++;
}
if(j!=i)
{
printf("   !");
return 0;
}
*x=p->data;
return 1;
}


void Destroy(SLNode **head)
{
SLNode *p,*p1;
p=*head;
while(p!=NULL)
{
p1=p;
p=p->next;
free(p1);
}
*head=NULL;
}