Nth from end for singly linked list

nthfromend.cpp

/* nth node from end */
void nthNodeFromEnd(node* head, int n)
{
    int size = 0;
    node* temp = head;
    for (; temp; ++size, temp = temp->next)
    { }
    
    if (size < n)
        return;
    
    temp = head;
    for (int i = 0; i < size - n - 1; ++i, temp = temp->next)
    { }
    if (temp)
        std::cout << n << "th node from end is " << temp->data << '\n';
}

/* nth node from end #2 (instructions taken from site) */
void nthNodeFromEndOther(node* head, int n)
{
    node* ref = head;
    node* main = head;
    
    for (int i = 0; i <= n; ++i)
        ref = ref->next;
    
    while (ref)
    {
        ref = ref->next;
        main = main->next;
    }
    
    if (main)
        std::cout << n << "th node from end is " << main->data << '\n';
    else
        std::cout << "Could not find element at position.\n";
}

/* Delete linked list */
void deleteLinkedList(node*& head)
{
    while (head)
    {
        node* temp = head->next;
        head = temp;
        delete head;
    }
}