LL13(Searching node)

#include <stdio.h>
#include<stdlib.h>
#include<stdbool.h>
struct node
{
  int data;
  struct node* next;
}*head=NULL;
void createlist(int n)
{
  struct node *new_node,*temp;
  int i,num;
  head=(struct node*)malloc(sizeof(struct node));
  scanf("%d",&num);
  head->data=num;
  head->next=NULL;
  temp=head;
  for(i=2;i<=n;i++)
  {
    new_node=(struct node*)malloc(sizeof(struct node));
    scanf("%d",&num);
    new_node->data=num;
    new_node->next=NULL;
    temp->next=new_node;
    temp=temp->next;
  }
}
bool checknode(struct node* head, int x) 
{ 
    struct node* current = head;
    while (current != NULL) 
    { 
        if (current->data == x) 
            return true; 
        current = current->next; 
    } 
    return false; 
} 
int main()
{struct node* new_node =(struct node*) malloc(sizeof(struct node));
  int n,x;
  scanf("%d",&n);
  createlist(n);
  scanf("%d",&x);
  checknode(head,x)? printf("Yes") : printf("No"); 
  return 0;
}