线性表的链式存储

PTA 6-1 链式表操作集
（大佬博客）
代码：

#include <stdio.h>
#include <stdlib.h>

#define ERROR NULL
typedef int ElementType;
typedef struct LNode *PtrToLNode;
struct LNode {
    ElementType Data;
    PtrToLNode Next;
};
typedef PtrToLNode Position;
typedef PtrToLNode List;

Position Find( List L, ElementType X );
List Insert( List L, ElementType X, Position P );
List Delete( List L, Position P );

int main()
{
    List L;
    ElementType X;
    Position P, tmp;
    int N;

    L = NULL;
    scanf("%d", &N);
    while ( N-- ) {
        scanf("%d", &X);
        L = Insert(L, X, L);
        if ( L==ERROR ) printf("Wrong Answer\n");
    }
    scanf("%d", &N);
    while ( N-- ) {
        scanf("%d", &X);
        P = Find(L, X);
        if ( P == ERROR )
            printf("Finding Error: %d is not in.\n", X);
        else {
            L = Delete(L, P);
            printf("%d is found and deleted.\n", X);
            if ( L==ERROR )
                printf("Wrong Answer or Empty List.\n");
        }
    }
    L = Insert(L, X, NULL);
    if ( L==ERROR ) printf("Wrong Answer\n");
    else
        printf("%d is inserted as the last element.\n", X);
    P = (Position)malloc(sizeof(struct LNode));
    tmp = Insert(L, X, P);
    if ( tmp!=ERROR ) printf("Wrong Answer\n");
    tmp = Delete(L, P);
    if ( tmp!=ERROR ) printf("Wrong Answer\n");
    for ( P=L; P; P = P->Next ) printf("%d ", P->Data);
    return 0;
}
Position Find( List L, ElementType X )
{
    PtrToLNode p=L;
    while(p!=NULL)
    {
        if(p->Data==X)
            return p;
        p=p->Next;
    }
    return ERROR;
}
List Insert( List L, ElementType X, Position P )
{
    List head=L;
    if(L==P)
    {
        head=(List)malloc(sizeof(struct LNode));
        head->Data=X;
        head->Next=P;
        return head;
    }
    while(L)
    {
        if(L->Next==P)
            break;
        L=L->Next;
    }
    if(!L)
    {
        printf("Wrong Position for Insertion\n");
        return ERROR;
    }
    L->Next=(List)malloc(sizeof(struct LNode));
    L->Next->Next=P;
    L->Next->Data=X;
    return head;
}
List Delete( List L, Position P )
{
    if(P==L)
    {
        L=P->Next;
        return L;
    }
    PtrToLNode a=L;
    while(L)
    {
        if(L->Next==P)
            break;
        L=L->Next;
    }
    if(!L)
    {
        printf("Wrong Position for Deletion\n");
        return ERROR;
    }
    L->Next=P->Next;
    return a;
}

PTA 6-2 带头结点的链式表操作集
（大佬博客）
代码：

#include <stdio.h>
#include <stdlib.h>

#define ERROR NULL
typedef enum {false, true} bool;
typedef int ElementType;
typedef struct LNode *PtrToLNode;
struct LNode {
    ElementType Data;
    PtrToLNode Next;
};
typedef PtrToLNode Position;
typedef PtrToLNode List;

List MakeEmpty(); 
Position Find( List L, ElementType X );
bool Insert( List L, ElementType X, Position P );
bool Delete( List L, Position P );

int main()
{
    List L;
    ElementType X;
    Position P;
    int N;
    bool flag;

    L = MakeEmpty();
    scanf("%d", &N);
    while ( N-- ) {
        scanf("%d", &X);
        flag = Insert(L, X, L->Next);
        if ( flag==false ) printf("Wrong Answer\n");
    }
    scanf("%d", &N);
    while ( N-- ) {
        scanf("%d", &X);
        P = Find(L, X);
        if ( P == ERROR )
            printf("Finding Error: %d is not in.\n", X);
        else {
            flag = Delete(L, P);
            printf("%d is found and deleted.\n", X);
            if ( flag==false )
                printf("Wrong Answer.\n");
        }
    }
    flag = Insert(L, X, NULL);
    if ( flag==false ) printf("Wrong Answer\n");
    else
        printf("%d is inserted as the last element.\n", X);
    P = (Position)malloc(sizeof(struct LNode));
    flag = Insert(L, X, P);
    if ( flag==true ) printf("Wrong Answer\n");
    flag = Delete(L, P);
    if ( flag==true ) printf("Wrong Answer\n");
    for ( P=L->Next; P; P = P->Next ) printf("%d ", P->Data);
    return 0;
}
List MakeEmpty()
{
    List a=(List)malloc(sizeof(struct LNode));
    a->Data=0;
    a->Next=NULL;
    return a;
}
Position Find( List L, ElementType X )
{
    List a=L;
    while(a)
    {
        if(a->Data==X)
            break;
        a=a->Next;
    }
    return a;
}
bool Insert( List L, ElementType X, Position P )
{
    List a=L;
    while(a->Next)
    {
        if(a->Next==P)
            break;
        a=a->Next;
    }
    if(a->Next!=P)
    {
        printf("Wrong Position for Insertion\n");
        return false;
    }
    a->Next=(List)malloc(sizeof(struct LNode));
    a->Next->Next=P;
    a->Next->Data=X;
    return true;
}
bool Delete( List L, Position P )
{
    if(!P)
    {
        printf("Wrong Position for Deletion\n");
        return false;
    }
    List a=L;
    while(a->Next)
    {
        if(a->Next==P)
            break;
        a=a->Next;
    }
    if(a->Next!=P)
    {
        printf("Wrong Position for Deletion\n");
        return false;
    }
//    a=(List)malloc(sizeof(struct LNode));
    a->Next=P->Next;
    return true;
}