Templated Queue Class

Problem

Write a program that has a templated Queue class that implements the Queue data structure. Additions to the queue should happen at the rear end, whereas deletions should happen from the front end. Make sure to check whether the queue is full before adding a new element and whether the queue is empty before removing an existing element from it.

Sample run

Here’s what you should see when you run the program.

Element 10 added to queue
Element 20 added to queue
Element 30 added to queue
Queue is full
Element deleted from queue = 10
Element deleted from queue = 20
Element deleted from queue = 30
Queue is empty

Coding solution

Here is a solution to the problem above.