#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
typedef struct node {
        int data;
        node *next;
};
node * insert (node * root,int data);
int main(){
    node * root =NULL ;
    root = (node *) malloc (sizeof (node));
    root->data = 10;
    root->next =NULL;
    node * iter =root;
    for(int i = 0;i<3;i++){
           iter=(node*) malloc(sizeof(node));
           iter->data = i*10;
           iter->next = root;
           root=iter;            
    }
    root=insert(root,1012);
        root=insert(root,12);
    iter=root;
    
    while(iter!=NULL)
    {
                           printf("\n%d",iter->data);
                           iter=iter->next;
    }
    
    getch();
    return 0;
}
node* insert (node * root,int data){
    
          node* iter=(node*) malloc(sizeof(node));
           iter->data = data;
           iter->next = root;
           return iter;  
     
}
