public class SortedDLL<T extends Comparable<T>> extends DoubleLinkedList<T> {

    @Override
    public void addLast(T t) {
    }

    @Override
    public void addFirst(T t) {
    }

    @SuppressWarnings("unchecked")
    public void addSorted(Comparable<T> t) {
        Node<T> newest = new Node<>(t, null, null);
        if (head == null) {
            head = newest;
            tail = newest;
            size = 1;
            return;
        }
        Node<T> curr = head;
        while (curr != null) {
            if (curr.data.compareTo((T) t) > 0)
                break;
            curr = curr.next;
        }
        if (curr == null) {
            tail.next = newest;
            newest.prev = tail;
            tail=newest;
        } else {
            // need to put in new node before curr
            Node<T> tmp = curr.prev;
            if (tmp != null)
                tmp.next = newest;
            newest.prev = tmp;
            newest.next = curr;
            curr.prev = newest;
            if (curr==head)
                head=newest;
        }
    }

    public static void main(String[] args) {
        SortedDLL<Rabbit> llr = new SortedDLL<>();
        Rabbit ar = new Rabbit(BreedEnum.Angora, "C1");
        llr.addSorted(ar);
        System.out.println(llr);

        llr.addSorted(new Rabbit(BreedEnum.DwarfDutch, "T1"));
        System.out.println(llr);

        llr.addSorted(new Rabbit(BreedEnum.FrenchLop, "M1"));
        System.out.println(llr);

        llr.addSorted(new Rabbit(BreedEnum.FrenchLop, "N1"));
        llr.addSorted(new Rabbit(BreedEnum.FrenchLop, "A1"));
        llr.addSorted(new Rabbit(BreedEnum.FrenchLop, "Z1"));
        System.out.println(llr);
    }
}