Algorithm

Node Structure: Define a node that holds data and a pointer to the next node. This node acts as the building block of the linked list used in the queue.
Queue Initialization: Initialize the queue with pointers to both the front and rear of the queue. Set these pointers to null initially, indicating an empty queue. Also, maintain a counter to track the number of elements in the queue.
Enqueue Operation (Adding an Element):
- Create a new node with the given data.
- If the queue is empty, set both the front and rear pointers to this new node.
- If the queue is not empty, link the current rear node to the new node and update the rear pointer to point to the new node.
Dequeue Operation (Removing an Element):
- Check if the queue is empty. If it is, return an appropriate message or handle the empty condition.
- If the queue is not empty, move the front pointer to the next node and delete the old front node.
- If the queue becomes empty after removal, set the rear pointer to null.
Peek Operation (Accessing the Front Element):
- Check if the queue is empty. If it is, return an appropriate message or handle the empty condition.
- If the queue is not empty, return the data of the front node without removing it.
Size Operation: Return the value of the counter tracking the number of elements in the queue.
IsEmpty Operation: Check if the front pointer is null. If it is, the queue is empty; otherwise, it is not.