head->next=NULL

q->next

p=p->next p->data

s->next=p->next; p->next=s;

p->next!=NULL; p->next=q->next;

求表长

void invent(Lnode *head)     {Lnode *p,*q;      if(!head->next) return ERROR;    ...

void merge(Lnode *L1, Lnode *L2)     {Lnode *p,*q ;      while(p->next!=L1) p=p->next; while...

void assending(Lnode *head)     {Lnode *p,*q , *r, *s;      p=head->next; q=p->next; p->nex...

void linklist_c(Lnode *head)     {Lnode *p; p=head;      if(!p) return ERROR; while(p->next!=NUL...

a2，a4等偶数节点 将链表中的偶数节点数据复制到顺序表中

void Insert_sq(Sqlist va[], ElemType x)     {int i, j, n;      n=length(va[]);    &n...

3

(rear-front+m)%m

n-1

61

15

dcba abcd