Skip to content

Queues

Queue ADT📌

image-20241024172303362

A list or collection that its insertion can be performed from at one end(rear) and deletion can be performed at other end(front)

Note

Operations

  • EnQueue(x) orPush(x)
  • Dequeue()orPop()
  • front()orPeek()
  • IsEmpty()
1
2
void EnQueue(int x);
int Dequeue;

image-20241024172940265

Implementation of Queues📌

image-20241024173523081

1 ）Array Implementation📌