Linked List-Based Queue
Dynamic implementation with Front (Head) and Rear (Tail).
NULL
Size: 0Status: Queue is empty.
Speed
Algorithm Logic
1function enqueue(val):
2 node = new Node(val)
3 if rear == null:
4 front = rear = node
5 return
6 rear.next = node
7 rear = node