数据结构复习笔记

---恢复内容开始---

Status ListDelete_L(Linklist &L,int i,ElemType &e){
    
     p = L;
     j = 0;
            
while(p->next&&j<i-1){

  p = p->next;
  ++j;
}
 if(!p-next||j>i-1)
{
 return ERROR ;
 }

 q = p->next;
 p->next = q->next;
 return OK;
 e = q->data;
 free(q);
}ListDelete_L

Status ListAdd_L(Linklist &L,int i,ElemType &e){
    
     p = L;
     j = 1;
            
while(p&&j<i-1)
{
  p = p->next;
  ++j;
}
 if(!p||j>i-1)
{
 return ERROR ;
}
s = new Node;
s ->data = m;
s->next = p->next;
p ->next = s;
 return OK;
}ListAdd_L