[C]链表操作 新定义的节点一样要初始化

/*
 ============================================================================
 Name        : list.c
 Author      : 
 Version     :
 Copyright   : Your copyright notice
 Description : Hello World in C, Ansi-style
 ============================================================================
 */


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


typedef struct node
{
int data;
struct node *next;


}node_t;


int list_init(node_t *head)
{
int ret = -1;
head = (node_t *)malloc(sizeof(node_t));
if(NULL == head)
{
printf("list_init malloc failed\n");
}
else
{
head->data = 0;
head->next = NULL;
ret = 0;
}
return ret;


}


void insert_back1(node_t *head,unsigned int pos,int data)
{
unsigned int i = 0;
node_t *p = head;
node_t *new = NULL;
node_t *bk = NULL;




for(i=0;i<pos;i++)
{
p++;
}


new = (node_t *)malloc(sizeof(node_t));
if(NULL == new)
{
printf("insert_back malloc failed\n");
}
new->data = data;
new->next = NULL;


bk = p->next;
p->next = new;
new->next = bk;


}


int insert_back(node_t *head,int data)
{
node_t *p = head;
node_t *new = NULL;
int ret = -1;


new = (node_t *)malloc(sizeof(node_t));
if(NULL == new)
{
printf("insert_back malloc failed\n");
}
else
{
new->data = data;
new->next = NULL;


while(NULL != p->next)
{
p = p->next;
}


p->next = new;
ret = 0;
}
return ret;


}


void printf_list(node_t *head)
{
node_t *p = NULL;
p = head;


while(p->next != NULL)
{
printf("%d ",p->next->data);
p = p->next;
}
printf("\n");
}


int main(void) {
puts("!!!Hello World!!!"); /* prints !!!Hello World!!! */
node_t head;
int ret = -1;
memset(&head,0,sizeof(node_t));
ret = list_init(&head);
if(0 != ret)
{
return -1;
}


ret = insert_back(&head,0);
if(0 != ret)
{
printf("insert fail\n");
}
ret = insert_back(&head,1);
if(0 != ret)
{
printf("insert fail\n");
}
ret = insert_back(&head,3);
if(0 != ret)
{
printf("insert fail\n");
}


printf_list(&head);


puts("!!!OK!!!"); /* prints !!!OK!!! */
return EXIT_SUCCESS;
}