reverse.cpp

void reverse() noexcept
{
    // to reverse the list we simply have to switch the nodes until the head becomes the tail
    node_ptr current;
    current = std::move(head);
    node_ptr next = nullptr;
    node_ptr temp = nullptr;

    while (current != nullptr)
    {
        next = std::move(current->next);
        current->next = std::move(temp);
        temp = std::move(current);
        current = std::move(next);
    }
    head = std::move(temp);
}