判定一个顺序栈（存储空间长度Maxsize）为栈满的条件是______

A.top != -1

B.top == -1

C.top != Maxsize

D.top== Maxsize -1

A.st.top==-1

B.st.top!=-1

C.st.top!=MaxSize

D.st.top==MaxSize

A.top！=0

B.top= =0

C.top！=m0

D.top= =m0-1

A.top= =1

B.top= =-1

C.top= =0

D.top!=0

A.插入操作更方便

B.通常不会出现栈满的情况

C.不会出现栈空的情况

D.删除操作更加方便

A.(rear+1)%Maxsize == front

B.rear-front-1 == m0

C.front == rear

D.front == rear+1

A.t.base == NULL

B.st.top == st.stacksize

C.st.top-st.base>=st.stacksize

D.st.top == st.base

A.12345ABCDE

B.ABCDE12345

C.EDCBA54321

D.54321EDCBA