链表的定义
typedef struct LNode{
ElenType data;
struct LNode next;
}*Link,*Position;
Position find(Link L,ElemType e){
Postion p=L;
while(p&&p->data!=e)
p=p->next;
if(p) return p;
else
retutn ERROR;
}
boolean Insert(Link L,ElemType e,Position p){ //在P结点之前插入
Position temp,q;
for( q=L; q&&q->next!=p; q=q->next) ;
if(q=null) return false;
else{
temp=(Positon)malloc(sizeof(LNode));
temp->data=e;
q->next=temp;
return true;
}
}
boolean delete(Link L,ElemType e,Position p){
Position q;
for(q=L; q&&q->next!=p;q=q->next) ;
if(q=null||p=null) return false;
else{
q->next=p->next;
free(p);
return true;
}
}