- A queue is a data structure that follows the First In, First Out (FIFO) principle.
- In a queue, the first element added is the first one to be removed.
- A queue is like a line of people waiting for a service.
- The person who arrives first is served first, and new people join the line at the end.

Operations:
- Enqueue (or Insert): Add an element to the back of the queue.

- Dequeue (or Remove): Remove the element from the front of the queue.

-
Front: View the front (first) element without removing it.
-
Rear (or Back): View the rear (last) element without removing it.
-
Display - view the complete queue by displaying it to the console
-
IsFull - check if the queue is full; if rear>= maxsize
-
isempty - if front -1 or rear -1; queue is empty.