Implement a generic Queue data structure in Java using a linked list. The Queue should support the basic operations of enqueue, dequeue, peek, and check if the queue is empty.

Sure, here is a simple implementation of a Queue data structure in Java using a linked list:

import java.util.LinkedList;

public class Queue<T> {
    private LinkedList<T> list = new LinkedList<T>();

    // Add element to end of queue
    public void enqueue(T item) {
        list.addLast(item);
    }

    // Remove element from front of queue
    public T dequeue() {
        if (list.isEmpty()) {
            return null;
        }
        return list.removeFirst();
    }

    // Get element from front of queue without removing it
    public T peek() {
        if (list.isEmpty()) {
            return null;
        }
        return list.getFirst();
    }

    // Check if the queue is empty
    public boolean isEmpty() {
        return list.isEmpty();
    }
}

In this code:

• We use a LinkedList to store the elements of the queue. The end of the LinkedList represents the end of the queue and the start of the LinkedList represents the front of the queue.
• The enqueue method adds an element to the end of the queue.
• The dequeue method removes an element from the front of the queue and returns it. If the queue is empty, it returns null.
• The peek method returns the element at the front of the queue without removing it. If the queue is empty, it returns null.
• The isEmpty method checks if the queue is empty.