C++中的链表递归引用调用

#include <iostream>

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

void traverseList(ListNode* node) {
    if (node == nullptr) {
        return;
    }
    
    std::cout << node->val << " ";
    traverseList(node->next);
}

int main() {
    // 创建链表
    ListNode* head = new ListNode(1);
    ListNode* node1 = new ListNode(2);
    ListNode* node2 = new ListNode(3);
    head->next = node1;
    node1->next = node2;
    
    // 遍历链表
    traverseList(head);
    
    // 释放链表内存
    delete node2;
    delete node1;
    delete head;
    
    return 0;
}