线性表链式存储（单链表）

#include<iostream>
#define maxsize 20
#define error 0
#define ok 1
typedef int elemtype;
typedef struct node
{
elemtype data;
struct node *next;
}node;
typedef struct node *linklist;

//search
elemtype getelem(linklist l, int i, elemtype *e)
{
int j;
linklist p;
p = l->next;
j = 1;
while (p&&j < i)
{
p = p->next;
++j;
}
if (!p || j>i)
return error;
*e = p->data;
return ok;
}
//insert
elemtype listinsert(linklist *l, int i, elemtype e)
{
int j;
linklist p, s;
p = *l; j = 1;
while (p&&j < i)
{
p = p->next;
++j;
}
if (!p || j>i)
return error;
s = new node;
s->data = e;
s->next = p->next;
p->next = s;
return ok;
}

//delete
elemtype listdelete(linklist *l, int i,elemtype *e)
{
int j;
linklist p, q;
p = *l;
j = 1;
while (p->next&&j < i)
{
p = p->next;
++j;
}
if (!(p->next) || j>i)
return error;
q = q->next;
p->next = q->next;
*e = q->data;
return ok;

}

//头插法
void createlisthead(linklist *l, int n)
{
linklist p;
int i;
*l = new node;                     //head
(*l) -> next = NULL;
for (i = 0; i < n; i++)
{
p = new node;
p->next = (*l)->next;
(*l)->next = p;
}
}

//尾插法

void createlisttail(linklist *l, int n)
{
linklist p, r;
int i;
*l = new node;
r = *l;
for (i = 0; i < n; i++)
{
p->next = p;
r = p;
}
r->next = NULL;
}