数据结构——A-Z的单链表

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

typedef char Elemtype;

typedef struct node
{
    Elemtype data;
    struct node *next;
}Lnode,*Linklist;

void createHead(Linklist *L)
{
    Linklist s;
    int i;
    printf("头插法：
");
    *L = (Linklist)malloc(sizeof(Lnode)); 
    (*L)->next = NULL;

    for(i=0;i<26;i++)
    {
        s = (Linklist)malloc(sizeof(Lnode));
        
        s->data = 65+i;
        s->next = (*L)->next;
        (*L)->next = s;
    }
}
void createRear(Linklist *L)
{
    Linklist s,rear;
    int i;
    printf("尾插法：
");

    *L = (Linklist)malloc(sizeof(Lnode));
    rear = *L;

    for(i=0;i<26;i++)
    {
        s = (Linklist)malloc(sizeof(Lnode));
        s->data = 65+i;
        rear->next = s;
        rear = s;
    }
    rear->next = NULL;

}
void print(Linklist L)
{
    Linklist p = L->next;
    while(p)
    {
        printf("%c ",p->data);
        p = p->next;
    }
    printf("
");
}
int main()
{
    Linklist La,Lb;
    
    createHead(&La);
    print(La);

    createRear(&Lb);
    print(Lb);

    return 0;
}