c solution

void printLinkedList(SinglyLinkedListNode* head) { SinglyLinkedListNode* current = head;

// Traverse the linked list and print each node's value
while (current != NULL) {
    printf("%d\n", current->data);
    current = current->next;  // Move to the next node
}

}

C++ Solution

void printLinkedList(SinglyLinkedListNode* head) {
    SinglyLinkedListNode* p=head;
    while(p!=0){
        cout<<p->data<<endl;
        p=p->next;
    }
}

Here is my c++ solution in simple way , you can watch the explanation

 SinglyLinkedListNode* temp=head;
    while(temp!=nullptr){
        cout<<temp->data<<"\n";
        temp=temp->next;
    }

Here is my c++ solution, you can watch the explanation here : https://youtu.be/t3gCqS1F24w

void printLinkedList(SinglyLinkedListNode* head) {

    while(head != nullptr){
        cout << head -> data << endl;
        head = head -> next;
    }
}

In the Hill Climb game, each race course is divided into several checkpoints, and these are stored sequentially in a linked list. Each node in the linked list contains the distance (in meters) from the starting point to a checkpoint. How to write a program that prints all the checkpoint distances in the order they appear in the list.