K12教育赛事综合服务平台
聚乐之家官方网站
下载聚乐之家官方App
专注青少年竞赛题库网站
已知双向链表结点定义为：typedef struct DNode { int data; struct DNode *prior, *next; } DNode;，p指向链表中已存在的任意结点，q指向待插入的新结点，要求将q插入到p的后方。
typedef struct DNode { int data; struct DNode *prior, *next; } DNode;
q->prior = p; p->next = q; q->next = p->next; if(p->next != NULL) p->next->prior = q;
q->next = p->next; p->next->prior = q; q->prior = p; p->next = q;
q->prior = p; q->next = p->next; if(p->next != NULL) p->next->prior = q; p->next = q;
p->next = q; q->prior = p; q->next = p->next; p->next->prior = q;