单链表1.创建：头插法while(x!=-1){  s=(LinkList)malloc(sizeof(LNode));  s->data=x;  s->next=H->next;  H-next=s;}return H;尾插法while(x!=-1){  s=(LinkList)malloc(sizaof(LNode));  s->data=x;  s->next=r->next;  r->next=s;  r=x;}return H;2.查找Get_Linklist(H,k)while(p->next!=null&&j
     
      next;  j++;}if(j==k) return p;else return NULL;3.插入操作将s插入到p后面s->next=p->next;p->next=s;将s插入到p的前面q=H;while(q->next!=p){  q->next=q;s->next=q->next;q->next=s;将s插在第i个节点的位置上p=Get_Linklist(H,i-1);if(p==NULL) 插入错误else{  s->next=p->next;  p->next=s;  return true;}4.删除p=Get_LinkList(H,i-1);if(p==null&&p->next==null) return error;else{  q=p->next;  p->next=q->next;  free(q);;  return true;}循环链表1.合并p=RA->next;RA->next=RB->next->next;free(RB->next);RB->next=p;双向链表(p->prior->next=p,p=p->next->prior)1.将s插入到p的前面s->prior=p->prior;p->prior->next=s;s->next=p;p->prior=s;2.删除操作p->prior->next=p->next;p->next->prior=p->prior;free(p);