cenas

public V insert(K key, V value) {

        V oldValue = null;
        int cont = 0;
        DListNode<Entry<K, V>> node = head;
        while (node != null && key.compareTo(node.getElement().getKey()) > 0) {
            node.getNext();
            cont++;
        }
        Entry<K, V> elem = new EntryClass<K, V>(key, value);
        if (isEmpty() || cont == 0)/* significa que k e menor que a head */{
            this.addFirst(elem);
        } else if (cont == this.size) {
            this.addLast(elem);
        } else {
            if (node.getElement().getKey().equals(key)) {
                oldValue = node.getElement().getValue();
                node.getElement().setValue(value);
            } else{
                this.addMiddle(node, elem);
            }

        }
        return oldValue;
    }