题目内容

In any case, quick sorting can get the result as quickly as possible.

查看答案
更多问题

What two types of data structures can be logically classified in data structures?

A. Dynamic and Static
B. Linear and no-linear
Compact and non-compact
D. Internal and external

Suppose q and p are pointers in singly linked list, q is predecessor of p, if we want to insert s node between q and p, we should execute ( )

A. s->next=p->next; p->next=s;
B. p->next=s->next; s->next=p;
C. q->next=s; s->next=p;
D. p->next=s; s->next=q;

The postfix expression of a * ( b + c ) - d is ( )

A. a*bc+d-
B. abcd*+-
C. bc+d-a*
D. abc+*d-

If a stack sequence is 1,2,3,4,5, the impossible output sequence is ()

A. 5,4,3,2,1
B. 4,5,3,2,1
C. 4,3,5,1,2
D. 1,2,3,4,5

答案查题题库