import java.util.Iterator;

public class VaksineKoe<T extends Comparable<T>> implements PListe<T>, Iterable<T>{
    
    Node<T> start;

    @Override
    public void leggTil(T t) {
        
        Node<T> nyNode = new Node<>(t);

        if (start == null) {
            start = nyNode;
            return;
        }
        else if (start.verdi.compareTo(t) <= 0) {
            nyNode.neste = start;
            start = nyNode;
            return;
        }
        
        Node<T> iter = start;
        while (iter.neste != null && iter.neste.verdi.compareTo(t) > 0) {
            iter = iter.neste;
        }

        nyNode.neste = iter.neste;
        iter.neste = nyNode;

    }

    @Override
    public T fjern() {
        if (start == null) {
            throw new IndexOutOfBoundsException();
        }
        T fjernes = start.verdi;
        start = start.neste;
        return fjernes;
    }

    public void skrivUt() {
        Node<T> iter = start;

        while (iter != null) {
            System.out.println(iter.verdi);
            iter = iter.neste;
        }
    }

    public VaksineKoeIterator<T> iterator() {
        return new VaksineKoeIterator<T>(this);
    }
}

class VaksineKoeIterator<T extends Comparable<T>> implements Iterator<T> {

    private Node<T> iter;

    VaksineKoeIterator(VaksineKoe<T> vk) {
        iter = vk.start;
    }

    @Override
    public T next() {
        T utData = iter.verdi;
        iter = iter.neste;
        return utData;
    }

    @Override
    public boolean hasNext() {
        return iter != null;
    }
}

class Node<T> {

    T verdi;
    Node<T> neste;

    Node (T t) {
        verdi = t;
    }
}