Linked list: Traverse and insert , C (clang)

Language: Layout:

//clang 3.8.0
#include <stdlib.h>
#include  <stdio.h>
struct node{
int data;
struct node *next;
};
typedef struct node Node;
void printNode(Node* n){
Node *temp=n;
while(temp!=NULL){
printf("%d->",temp->data);
temp=temp->next;
}
printf("\n");
}
void insertAtFront(Node **n,int value){
Node *temp=*n;
Node *newNode;
newNode=malloc(sizeof(Node));
newNode->data=value;
newNode->next=temp;
temp=newNode;
*n=temp;
}
void insertAtMiddle(Node *n,int value,int pos){
Node *temp=n;
Node *newNode;
newNode=malloc(sizeof(Node));
newNode->data=value;
for(int i=2;i<pos;i++ ){
if(temp->next!=NULL){
temp=temp->next;
}
}
newNode->next=temp->next;
temp->next=newNode;
}
void insertAtEnd(Node *n,int value){
Node *temp=n;
Node *newNode;
newNode=malloc(sizeof(Node));
newNode->data=value;
newNode->next=NULL;
while(temp->next!=NULL){
temp=temp->next;
}
temp->next=newNode;
}
void deleteFromFront(Node **n){
Node *temp=*n;
temp=temp->next;
*n=temp;
}
void deleteFromMiddle(Node *n,int pos){
Node *temp=n;
for(int i=2;i<pos;i++ ){
if(temp->next!=NULL){
temp=temp->next;
}
}
temp->next=temp->next->next;
}
void deleteFromEnd(Node *n){
Node *temp=n;
while(temp->next->next!=NULL){
temp=temp->next;
}
temp->next=NULL;
}
int main(void)
{
Node *head; 
Node *one;
Node *two;
Node *four;
one=malloc(sizeof(Node));
two=malloc(sizeof(Node));
four=malloc(sizeof(Node));
one->data=1;
one->next=two;
two->data=2;
two->next=four;
four->data=4;
four->next=NULL;
head=one;
printNode(head);
insertAtFront(&head,0);
printNode(head);
insertAtMiddle(head,3,4);
printNode(head);
insertAtEnd(head,5);
printNode(head);
deleteFromFront(&head);
printNode(head);
deleteFromMiddle(head,3);
printNode(head);
deleteFromEnd(head);
printNode(head);

return 0;
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 0.23 sec, absolute running time: 0.07 sec, cpu time: 0.01 sec, memory peak: 3 Mb, absolute service time: 0,3 sec