ЯМП кп списки №1

Node* SearchMax()
{
    Node* tmp = head->Next;
    Node* address = head;
    int max = head->Value;
    while (tmp != nullptr)
    {
        if (max < tmp->Value)
        {
            max = tmp->Value;
            address = tmp;
        }
        tmp = tmp->Next;
    }

    max = head->Value;
    head->Value = address->Value;
    address->Value = max;

    return nullptr;
}