A. HS->next=s; s->next=HS; B. s->next= HS->next; HS =s; C. s->next=HS; HS =s; D. s->next= HS; HS =HS->next;
A. x=HS;HS=HS>next; B. x= HS->data; C. HS=HS>next; x= HS->data D. x= HS->data; HS =HS->next
A. 顺序表 B. 链表 C. 队列 D. 栈
A. 4,3,2,1 B. 1,2,3,4 C. 1,4,3,2 D. 3,2,4,1
A. (Q.rear+1)%MaxSize==Q.front B. Q.rear=0 C. Q.front==Q.rear D. Q.front==Q.rear+1
A. 2 B. 3 C. 4 D. 5
A. 对 B. 错