#include<conio.h>
#include<stdio.h>
#define NODE 4
struct node{int info;struct node *next;};
void create
{
 int i,n,x;
 printf("ENTER HOW MANY NODES:\n");
 scanf("%d",&n);
 for(i=1;i<n;i++)
 {
  printf("ENTER INFO:\n");
  scanf("%d",&x);
  insert(head,x,i);
 }
}
void insert(struct node *head,int x,int j)
{
 struct *p,*q;
 q=(struct node *)malloc(sizeof(struct node));
 q->info=x;
 if(j==1)
 {
  q->next=head;
  head=q;
 }
 else
 {
  p=head;
  for(i=1;i<j-1;i++) p=p->next;
  q->next=p->next;
  p->next=q;
 }
}
void makeempty(struct node *head)
{
 struct node *p,*q;
 p=head;
 while(p!=NULL)
 {
  q=p;p=p->next;free(q);
 }
 head=NULL;
}
void display(struct node *head)
{
 struct node *p;
 p=head;
 while(p!=NULL)
 {
  printf("%d",p->info);
  p=p->next;
 }
}
void main()
{
 struct node *head;
 head=NULL;
 int i,n;
 while(1)
 {
  printf("1.CREATE\n 2.INSERT\n 3.MAKEEMPTY\n 4.DISPLAY\n 5.EXIT\n");
  printf("ENTER UR CHOICE 1/2/3/4/5\n");
  scanf("%d",&n);
  if(n==5) break;
  switch(n)
  {
   case 1: