How to implement circular linked list in java?

Question

I read a book about \"Data structures and algorithms\" in which there is assignment which asks me to implement a circular linked list. This is a learning exercise and my code ma

Answer 1

Your delete() method doesn't handle the circularity of the list. The last element points to the first element; that also needs updating when the first element is deleted.

In other words, you need to set last.next to point to the new first rather than the old first.

The other issue you have is that if you delete the final element (so that it's now empty), then you also need to set last to null.

public Link delete() {
    if (first.next == null) {
        first = null;
        last = null;
    }
    Link temp = first;
    first = first.next;
    last.next = first;
    return temp;
}