Update next LIST ADT header without using an iterator

Question

How do I upgrade to a new node chapter without using the following?

private E head;
private someList<E> tail;

public E removeHead(){
        this.tail = this.tail.getTail();  
        return this.head;
    }

Answer 1

I think this is what you want?

public E removeHead(){
    E oldhead = this.getHead();  // keep old head, so we can return it
    this.head = this.getTail().getHead(); // new head: comes out of old tail
    this.tail = this.getTail().getTail(); // new tail: remainder of old tail
    return oldhead;
}

public getHead(){ return head;}

public getTail(){ return tail;}

I assume that you have already implemented getTail?