双链表删除方法

尝试实现一个方法，该方法删除指定索引处的节点并返回其数据元素。参加一个初学者在线课程，我不知道如何返回E类型的数据。如果我的代码太糟糕，我很抱歉。

public class MyLinkedList<E> extends AbstractList<E> {
    LLNode<E> head;
    LLNode<E> tail;
    int size;
    /** Create a new empty LinkedList */
    public MyLinkedList() {
        size = 0;
        head = new LLNode<E>(null); 
        tail = new LLNode<E>(null);
        head.next = tail;
        tail.prev = head;
    public E remove(int index) 
    {
        int ithNode = 1; //tracks node path location
        LLNode<E> newNode = new LLNode<E>(null);
        if (index < 0 || index > size()) {
            throw new IndexOutOfBoundsException();
        }
        if (index == 1) {
            newNode = head.next;
            head.next = null;
            head.prev = null;
        } else {
            while (ithNode != index) {
                head = head.next;
                ithNode++;
            }
            if (head.next == null) {
                head.prev.next = null;
                head.prev = null;
            } else {
                head.prev.next = head.next;
                head.next.prev = head.prev;
            }
        }
    }
}
class LLNode<E> 
{
    LLNode<E> prev;
    LLNode<E> next;
    E data;
//Not sure if I should create another constructor here 
    public LLNode(E e) 
    {
        this.data = e;
        this.prev = null;
        this.next = null;
    }
}