If (rear==maxsize-1) rear=0; else rear=rear+1; is required in:
A. circular queue
B. linear queue
C. stack
D. deque
Answer:D
If (rear==maxsize-1) rear=0; else rear=rear+1; is required in:
A. circular queue B. linear queue C. stack D. deque
Explanation: A double-ended queue (dequeue, often abbreviated to deque) is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail). It is also often called a head-tail linked list.