下面循环队列采用“空出一个位置”的方式区分队空和队满。横线处应填写（ ）。
const int MAXN = 8;
int data[MAXN];
int front = 0, rear = 0;
bool full() {
return __________________________;
}
- A.
rear == front - B.
(front + 1) % MAXN == rear - C.
(rear + 1) % MAXN == front - D.
rear == MAXN - 1