在循环双链表的p所指结点后插入s所指结点的操作是( )。A. p->next=s; s->next=p; p->next->prior=s; s->next= p->next;B. p->next=s; p->next->prior=s; s->prior=p; s->next= p->next;C. s->prior=p; s->next= p->next; p->next=s; p->next->prior=s;D. s->prior=p; s->next= p->next; p->next->prior=s; p->next=s;
查看答案
一个队列的入队顺序是1,2,3,4,则队列的输出顺序是( )A. 4,3,2,1 B. 1,2,3,4 C. 1,4,3,2 D. 3,2,4,1
一个顺序栈S,其栈顶指针为top,则将元素e入栈的操作是( )A. *S->top=e; S->top++; B. S->top++; *S->top=e;C. *S->top==0 C. S->top=e;
循环队列用数组A[0,...m-1]存放元素,已知其头尾指针分别是front和rear.则当前队列中的元素个数是( ).A.(rear-front+m)%m B. rear-front+1C. rear-front-1 D. rear-front
在一个链队列中,假定front和rear分别为队头指针和队尾指针,删除一个结点的操作是( )。A.front=front->next B. rear =rear->nextC. rear->next=front D. front->next=rear