Implement Queue using linked list

• Create a Node class with data and next pointer

• Maintain pointers for front and rear of the queue

• Implement enqueue() to add elements and dequeue() to remove elements