Removing an element from a circular linked list

Question

Here I have my code that deletes a given integer value from a circular linked list:

public void remove(int item){

Node temp = tail.next; //Refers to the first index

Node prev_node= null;

if (temp.value == item) { // If item is first element

tail.next = temp.next;

} else {

while (temp != tail && temp.value != item) {

prev_node = temp;

temp = temp.next;

}

if (temp == tail) {

if (tail.value != item) {

return;

} else {

prev_node.next = tail.next;

tail = prev_node.next;

}

} else {

prev_node.next = temp.next;

}

}

}

My code works until the temp node is equal to the tail. For example, let's say I have a circular linked list and the data (not memory allocation) within a list would be [1,2,3,4]. If I want to delete 4 out of the circular linked list, it will delete it but the order is [2,3,1]. The first element then appears at the end of the list. I'm not sure exactly what I have done wrong. I know the error is in the second if statement.

Answer 1

It is a circular linked list.

The head pointer after the delete is now pointing to the element 2.

Fix the code to point it to the element 1.

You would then see [1,2,3] after the delete.