Data Struct O-7(2)

#include<stdio.h>
#include<stdlib.h>
typedef struct Database{
int d;
struct Database *n;
}node;
node *h;
int main(){
createList();
printList();
deleteData();
printList();
}
void deleteData(){
  int a;
printf("Enter The Desired Data : ");
scanf("%d",&a);
node *list=h;
if(list->n->d==a){
    node *tmp=h;
    h=h->n;
    free(tmp);
    return;
}
while(list->n->n){
    if(list->n->n->d==a){
        node *tmp=list->n;
        list->n=list->n->n;
        free(tmp);
        return;
    }
    list=list->n;
}
printf("Data Not Found In Any Node\n");
}

void createList(){
node *list=(node*)malloc(sizeof(node));
int a,b;
printf("Enter Amount Of Node : ");
scanf("%d",&a);

printf("Enter Node 1 : ");
scanf("%d",&b);
list->d=b;
list->n=NULL;
h=list;
loop(a-1);
}
void loop(int n){
for(int i=1;i<=n;i++){
    printf("Enter Node %d : ",i+1);
     int a;
    scanf("%d",&a);
    addLast(a);
}
}
void addLast(int a){
   node *list=h;
while(list->n){
    list=list->n;
}
node *temp=(node*)malloc(sizeof(node));
temp->d=a;
temp->n=NULL;
list->n=temp;
}
void printList(){
node *list=h;
while(list){
    printf("%d ",list->d);
    list=list->n;
}
printf("\n");
}