This is C++ implementation of queue data structure. The principle of first in first out (FIFO) applies to this data structure.
The queue classs is implemented first by using C++ array and node class separately.
The interface hass four main functions: Insert Deque printelements getSize