The ones who are crazy enough to think they can change the world are the ones who do.- Steve Jobs
A queue is also another important type of data structure. In queue, a new element will be inserted to the back of all elements(rear) which are already present in an array. In queue, a deletion operation can only be performed on the bottom most or first element ( front ) in an array. Queue is well known as FIFO ie) First In First Out.
Queue can be represented either by using array or by using linked list. For known or fixed amount of elements, queue is represented using array. For unknown or infinite amount of elements, queue is represented using linked list.
We may make mistakes(spelling, program bug, typing mistake and etc.), So we have this container to collect mistakes. We highly respect your findings.