Can we implement queue using singly linked list

#1

can we implement queue using singly linked list ,if possible could you plz share me the code

#2

Queue implements the FIFO mechanism i.e the element that is inserted first is also deleted first. In other words, the least recently added element is removed first in a queue. you only have to manipulate FRONT and REAR to get Queue property.so we need doubly linked list for this