can someone help understand this function please? its for a singly linked list and tailRemove is a function that removes a specified element from the end of the linked list, but i dont really understand the code and its in C++

void LinkedList::tailRemove(int data)

{

Node *temp = head;

Node *prev = NULL;

while(temp->next != NULL)

{

prev = temp;

temp = temp->next;

}

if(temp->data == data)

{

prev->next = NULL;

delete temp;

return;

}

cout << data << " not found in linked list" << endl;

}