如何在C++中模拟递归类型定义？

// 前向声明
struct Node;

// 定义节点结构体
struct Node {
    int data;
    Node* next;
};

// 创建一个递归类型的函数
Node* createLinkedList(int n) {
    if (n == 0) {
        return nullptr;
    }

    Node* newNode = new Node;
    newNode->data = n;
    newNode->next = createLinkedList(n - 1);

    return newNode;
}

int main() {
    int n = 5;
    Node* head = createLinkedList(n);

    // 打印链表
    Node* curr = head;
    while (curr != nullptr) {
        cout << curr->data << " ";
        curr = curr->next;
    }

    // 释放内存
    curr = head;
    while (curr != nullptr) {
        Node* temp = curr;
        curr = curr->next;
        delete temp;
    }

    return 0;
}