Is this a good method?

Reverse List C#

Void Reverse (Node head)
{
    Node prev= null;
    Node current = head;
    Node nextNode = null;

        while (current!=null)
        {
                nextNode = current.Next;
                current.Next = prev;
                prev=current;
                current = nextNode;     

        }
        head = prev;

}