Can someone explain the code line by line, its C++ data structures for a singly linked list

void LinkedList::tailDisplay(ostream &out)

{

//temp will be current node with going through the list

Node *temp = tail;

//iterates through the linked list backwards, when the linked list(node) isnt empty

while(temp != nullptr)

{

out << temp->data << " ";

temp = temp->next;

}

out << endl;

}