Queue arranges element in such a way that new element always gets added in the back and also when comes the removal it removes the last or oldest element or which is the first element in the queue. It is also known as FIFO or First In First Out.
Let us take a situation of a long row of queue of people at the entrance. Now when the entrance will be open the first person who was waiting will be removed. Then evey person will be shifted one position in the front. If some new person comes he/she has to stand at the back of the last person.
A queue can easily be visualized with the help of a linked list or collection where nodes are added at tail and deleted from head or from the front.