A. s= p->next; p=p->next; free(s); B. p=p->next; free(p); C. s= p->next; p->next=s->next; free(s); D. p=p->next; free(p->next);
A. p->next=s; s->next=p->next; B. s->next=p->next; p->next=s; C. p->next=s; p->next=s->next; D. p->next=s->next; p->next=s;
A. L=s; s->next=L; B. s->next=L; L=s; C. s=L; s->next=L; D. s->next=L; s=L;