Here is header link list programming code. in first block have function initialization,after that node insertion and traversing the header list then the main function will call.if you get any compilation error please do comment in below of this post.

/* header link list with the help of function */
/* header_link_list.C */
/* http://native-code.blogspot.com */

# include <stdio.h>
# include <malloc.h>

struct link
{
    int info;
    struct link *next;
};

int i;
int number;
struct link *start, *new1;

void insertion(struct link *);
void create_header_list(struct link *);
void Traverse (struct link *);

/* Function to create a header linked list */
/* http://native-code.blogspot.com */

void create_header_list(struct link *node)
{
    char ch;

    start->next = NULL;  /* Empty list */

    node = start;      /* Point to the header node of the list */
    node->next = (struct link* ) malloc(sizeof(struct link)); /* Create header node */
    i = 0;
    printf("\n Input choice n for break: ");
    ch = getchar();
    while(ch != 'n')
    {
        node->next = (struct link* ) malloc(sizeof(struct link));
        node = node->next;
        printf("\n Input the node: %d: ", i+1);
        scanf("%d", &node->info);
        node->next = NULL;
        fflush(stdin);
        printf("\n Input choice n for break: ");
        ch = getchar();
        i++;
    }
    printf("\n Total nodes = %d", i);
    node = start;
    node->info = i; /* Assign total number of nodes to the header node */
}

/* Inserting a node */
/* http://native-code.blogspot.com */

void insertion(struct link *node)
{
    int node_number = 1;
    int insert_node;
    int count = node->info;
    node = node->next;
    node = start;

    printf("\n Input node number you want to insert: ");
    printf("\n Value should be less are equal to the");
    printf("\n number of nodes in the list: ");
    scanf("%d", &insert_node);

    while(count)
    {
        if((node_number) == insert_node)
        {
            new1 = (struct link* ) malloc(sizeof(struct link));
            new1->next = node->next ;
            node->next = new1;
            printf("\n Input the node value: ");
            scanf("%d", &new1->info);
            node = node->next;
        }
        else
        {
            node = node->next;
            count--;
        }
        node_number ++;
    }
    node = start;
    node->info = node->info+1;
}

/* Traversing the header list */
/* http://native-code.blogspot.com */

void Traverse(struct link *node)
{
    int count = node->info;
    node = start;

    node = node->next;
    printf("\n After Inserting a node list is as follows:\n");
    while (count)
    {
        printf("\n 0x%x", node);
        printf(" %d", node->info);
        node = node->next;
        count --;
    }
}

/* Function main */
/* http://native-code.blogspot.com */

void main()
{
    struct link *node = (struct link *) malloc(sizeof(struct link));

    create_header_list (node);
    Traverse (node);
    insertion (node);
    Traverse (node);
}

/* http://native-code.blogspot.com */