A.Q->rear==Q->front
B.Q->rear+1==Q->front
C.（Q->rear+1）%MAXSIZE==Q->front
D.（Q->rear-1）%MAXSIZE==Q->front

A.Q->rear==Q->front
B.Q->rear+1==Q->front
C.（Q->rear+1）%MAXSIZE==Q->front
D.（Q->rear-1）%MAXSIZE==Q->front

A.Q->rear-Q->front
B.Q->rear-Q->front+1
C.（Q->rear-Q->front+MAXSIZE）%MAXSIZE
D.（Q->rear-Q->front+1+MAXSIZE）%MAXSIZE

A.*x=Q->next->data
B.*x=Q->front->data
C.*x=Q->front->next->data
D.*x=Q->rear->data

A.Q->rear->next=s；Q->rear=s
B.s->next=Q->front->next；Q->front->next=s
C.Q->next=s；Q=s
D.s->next=Q->next ；Q->next=s

A.斐波那契数列问题
B.N!问题
C.汉诺塔问题
D.尾递归问题

A.递归算法求解问题，方法简单
B.递归算法效率高
C.递归算法求解问题，方法复杂
D.递归算法的效率较低

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

A.DABEC
B.DCBAE
C.DEABC
D.CBADE

A.ABCDEF
B.ABCEDF
C.ABDEFC
D.ABFECD