싱글 체인

#include "main.h"
int main(int argc, char *argv[])
{
    List *head = NULL;
    int v1 = 5;
    int v2 = 6;
    head = list_create();
    list_insert( &head, v1 );
    list_insert( &head, v2 );
    list_print( head );
    list_destory( head );
    return 0;
}

#ifndef __MAIL_H__
#define __MAIL_H__
#include <stdio.h>
#include <stdlib.h>
#include "list.h"
#endif

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include "list.h"
List *list_create()
{
    List *head;
    head = (List *)malloc(sizeof(List));
    if (head)
    {
            head->data = 2;
            head->next = NULL;
            return head;
    }
    return NULL;
}
int list_insert( List **head, int data )
{
    List *tmp = *head, *p;
    List *v1;
    if(tmp == NULL)
    {
            v1 = (List *)malloc(sizeof(List));
            if(v1)
            {
                v1->data = data;
                v1->next = NULL;
                tmp->next = v1;
                printf("tmp->data = %d
", tmp->data);
            }
    }
    else
    {
            printf("====%d
",tmp->data);
                               
            while(tmp->next)
            {
                tmp = tmp->next;
            }
            v1 = (List *)malloc(sizeof(List));
            if(v1)
            {
                v1->data = data;
                v1->next = NULL;
                tmp->next = v1;
            }
    }
}
void list_print(List *node)
{
    List *tmp = node;
    while(tmp)
    {
            printf("The data is [%d]
",tmp->data);
            tmp = tmp->next;
    }
}
void list_destory(List *node)
{
    List *tmp = node;
    while( tmp )
    {
            free( tmp );
            tmp = tmp->next;
    }
}

#ifndef __LIST_h__
#define __LIST_h__
typedef struct _tag List;
struct _tag{
    int data;
    List *next;
};
int list_insert(List **head, int v1);
void list_delete(List *node);
void list_destory(List *node);
List *list_create();
void list_print(List *node);
#endif

all:main
CFLAGS=-g
main:main.o list.o
clean:
    rm -f *.o main