单链表的插入操作的实现(0952)

#include<cstdio>
#include<cstdlib>
#include<iostream>
using namespace std;
  
struct Node{
    int data;
    int length;
    struct Node *next;
}*l;
void Creatlist(Node *&L,int a[],int n){
    int i;
    Node *p;
    L=(Node *)malloc(sizeof(Node));
    L->next=NULL;
    for(i=n-1;i>=0;i--){
        p = (Node *)malloc(sizeof(Node));
        p->data=a[i];
        p->next=L->next;
        L->next=p;
    }
    l->length=n;
}
  
int main(){
    void Creatlist(Node *&L,int a[],int n);
    int n,m,data;
    int a[100];
    int i;
    cin>>n;
    for(i=0;i<n;i++){
        cin>>a[i];
    }
    cin>>m;
    cin>>data;
    Creatlist(l,a,n);
    if(m>n){
        cout<<"error!";
    }
    else{
        struct Node *r=l,*q=l->next;
        for(i=0;i<m-1;i++){
            q=q->next;
            r=r->next;
        }
        q = (Node *)malloc(sizeof(Node));
        q->data = data;
        q->next = r->next;
        r->next = q;
        n++;
        Node *s=l->next;
        for(i=0;i<n;i++){
              
            cout<<s->data<<' ';
            s = s->next;
        }
    }
return 0;
}