链表的创建、元素插入、元素删除、以及两个有序链表的归并

我只是个小菜，写这些东西是为了记下以后看，有什么问题欢迎大家指出，共同进步！

typedef struct LNode{
    int data;
    LNode *next;
}*LinkList;

void ListInsert(LinkList &L,int i,int e)
{
    LinkList p = L;
    int j = 0;
    while(p&&j<i-1) {p = p->next;++j;}
    if(!p||j>i-1)   cout<<"error2.."<<endl;
    
    LinkList s = (LinkList)malloc(sizeof(LNode));
    s->data = e;
    s->next = p->next;
    p->next = s;
}

void ListDelete(LinkList &L,int i,int &e)
{
    LinkList p = L;
    int j = 0;
    while (p->next && j<i-1)
    {
        p = p->next;
        ++j;
    }
    
    if(!(p->next)||j>i-1){cout<<"error3.."<<endl;}
    
    LinkList q = p->next;
    p->next = q->n