题目详情
多选题 已知循环队列数据结构定义如下:
初始化时置front和rear均为0,则队列非空非满时,元素e入队、出队(由e输出)操作为( )
A. 入队:elem[rear] = e; rear = (rear + 1) % MAXQSIZE;出队:front = (front + 1) % MAXQSIZE; e = elem[front]
B. 入队:rear = (rear + 1) % MAXQSIZE; elem[rear] = e;出队:e = elem[front]; front = (front + 1) % MAXQSIZE
C. 入队:rear = (rear + 1) % MAXQSIZE; elem[rear] = e;出队:front = (front + 1) % MAXQSIZE; e = elem[front]
D. 入队:elem[rear] = e; rear = (rear + 1) % MAXQSIZE;出队:e = elem[front]; front = (front + 1) % MAXQSIZE

学科:数据结构
时间:2024-04-26 03:48:12
相关题目
相关作业
