双向链表中有两个指针域:prior和next，分别指回前驱及后继。设p指向链表中的一个结点，q指向待插入结点，现要求在p前插入q,则正确的插入语句序列为

A.p-＞prior=q; q-＞next=p; p-＞prior-＞next=q; q-＞prior=p-＞prior;

B.q-＞prior=p-＞prior; p-＞prior-＞next=q; q-＞next=p; p-＞prior=q-＞next;

C.q-＞next=p; p-＞next=q; p-＞prior-＞next=q; q-＞next=p;

D.p-＞prior-＞next=q; q-＞next=p; q-＞prior=p-＞prior; p-＞prior=q;

E.q-＞prior=p-＞prior; q-＞next=p; q-＞prior-＞next=q;q-＞next-＞prior=q;

A.p-＞prior-＞next=p-＞next; p-＞next-＞prior=p-＞prior;

B.p-＞prior=p-＞prior-＞prior; p-＞prior-＞next=p;

C.p-＞next-＞prior=p; p-＞next=p-＞next-＞next;

D.p-＞next=p-＞prior-＞prior; p-＞prior=p-＞next-＞next;

E.p-＞next-＞prior=p-＞prior; p-＞prior-＞next=p-＞next;

A.p-＞prior-＞next=p-＞next; p-＞next-＞prior=p-＞prior;

B.p-＞prior=p-＞prior-＞prior; p-＞prior-＞next=p;

C.p-＞next-＞prior=p; p-＞next=p-＞next-＞next;

D.p-＞next=p-＞prior-＞prior; p-＞prior=p-＞next-＞next;

E.p-＞next-＞prior=p-＞prior; p-＞prior-＞next=p-＞next;

A.p-＞next=q; q-＞prior=p; p-＞next-＞prior=q; q-＞next=q;

B.p-＞next=q; p-＞next-＞prior=q; q-＞prior=p; q-＞next=p-＞next;

C.q-＞prior=p; q-＞next=p-＞next; p-＞next-＞prior=q; p-＞next=q;

D.q-＞prior=p; q-＞next=p-＞next; p-＞next=q; p-＞next-＞prior=q;

A.删除 p 结点

B.删除 p 结点的直接前驱结点

C.删除 p 结点的直接后继结点

D.删除 p 结点及其所有后继结点

A.L == NULL

B.L -＞ prior == L -＞ next

C.L -＞ prior == NULL

D.L -＞ next == NULL

A.rear-＞next == head

B.rear-＞next ＞next == head

C.head-＞next == rear

D.head-＞next-＞next == rear

E.head-＞prior == rear

F.rear-＞prior == head

A.rear-＞next == head

B.rear-＞next ＞next == head

C.head-＞next == rear

D.head-＞next-＞next == rear

E.head-＞prior == rear

F.rear-＞prior == head

A.p-＞next=p-＞next-＞next; p-＞next-＞next-＞prior=p;

B.p=p-＞next; p-＞next=p-＞next-＞next;

C.p-＞next=p-＞next;p-＞prior=p-＞next-＞prior;

D.p-＞next-＞next-＞prior=p; p-＞next=p-＞next-＞next;

A.下一个元素的地址

B.内存地址

C.下一个元素在数组中的位置

D.以上都不对