Find the middle of a linked list

idk.cpp

void printMiddle(Node* head) {
    if (head == NULL) {
        // Return because the list is empty
        return;
    }

    Node* slow_ptr = head; // This will traverse the list one element at a time
    Node* fast_ptr = head; // This will go through the list two elements at a time

    while (fast_ptr != NULL && fast_ptr->next != NULL) {
        slow_ptr = slow_ptr->next; // Next
        fast_ptr = fast_ptr->next->next; // Next next
    }
    // Once the fast pointer hits the end the slower pointer should have the data of the midle element
    std::cout << slow_ptr->data << std::endl;
}