尝试使用递归和指向指针的指针反转链表，但reversell函数未给出预期的正确输出

#include <iostream>

struct ListNode {
    int val;
    ListNode* next;
    ListNode(int x) : val(x), next(nullptr) {}
};

void reverseList(ListNode** head) {
    if (*head == nullptr || (*head)->next == nullptr) {
        return;
    }
    
    ListNode* prev = nullptr;
    ListNode* curr = *head;
    ListNode* next = nullptr;
    
    while (curr != nullptr) {
        next = curr->next;
        curr->next = prev;
        prev = curr;
        curr = next;
    }
    
    *head = prev;
}

void printList(ListNode* head) {
    ListNode* curr = head;
    while (curr != nullptr) {
        std::cout << curr->val << " ";
        curr = curr->next;
    }
    std::cout << std::endl;
}

int main() {
    ListNode* head = new ListNode(1);
    head->next = new ListNode(2);
    head->next->next = new ListNode(3);
    head->next->next->next = new ListNode(4);
    head->next->next->next->next = new ListNode(5);
    
    std::cout << "Original List: ";
    printList(head);
    
    reverseList(&head);
    
    std::cout << "Reversed List: ";
    printList(head);
    
    return 0;
}