#include<stdio.h>
#include<conio.h>
#include<alloc.h>
#include<stdlib.h>
 
struct element
{
   int info;
   struct element *next;
}*start,*temp;
 
typedef struct element node;
 
void create();
void insert();
void dele();
void display();
 
void main()
{
	int ch;
	clrscr();
 
	while(ch!=5)
	{
		printf("\nEnter Your Choice");
		printf("\n1.Create\n2.Insert\n3.Delete\n4.Display\n5.Exit");
		scanf("%d",&ch);
 
 
			switch(ch)
			{
			case 1:
				create();
				break;
			case 2:
				insert();
				break;
			case 3:
				dele();
				break;
			case 4:
				display();
				break;
			case 5:
				exit(0);
 
			}
 
       }
 
 
}
 
void create()
{
	int ch1;
	node *list,*newnode;
	clrscr();
 
	printf("Enter The Element(For Exit Press -1):= ");
	scanf("%d",&ch1);
 
	while(ch1!=-1)
	{
 
	newnode=(node *)malloc(sizeof(node));
 
	if(start==NULL)
	{
	start=newnode;
	}
 
	newnode->info=ch1;
	newnode->next=NULL;
 
	list->next=newnode;
	list=newnode;
 
	printf("\nEnter The Element(For Exit Press -1):= ");
	scanf("%d",&ch1);
 
       }
 
 
}
 
void insert()
{
	char ch;
	int newinfo,posi,i=2;
	node *prev,*newnode;
 
	printf("\nEnter The Element:= ");
	scanf("%d",&newinfo);
 
	do
	{
		printf("\nEnter The Position:= ");
		scanf("%d",&posi);
 
		if(posi<1)
		{
 
		printf("\nInvalid Position");
 
		}
 
	}while(posi<1);
 
	newnode=(node *)malloc(sizeof(node));
	newnode->info=newinfo;
 
	if((posi==1) || (start==NULL))
	{
		newnode->next=start;
		start=newnode;
	}
       else
       {
		prev=start;
 
		while(i < posi )
		{
 
		prev=prev->next;
		i++;
 
		}
 
		newnode->next=prev->next;
		prev->next=newnode;
      }
 
}
 
void dele()
{
	int deleinfo;
	node *prev,*list;
 
	printf("Enter The Element:= ");
	scanf("%d",&deleinfo);
 
	if(start==NULL)
	{
	   printf("List is Empty");
	   getch();
	}
	else
	{
	   prev=NULL;
	   list=start;
 
		while((list->info!=deleinfo) && (list->next!=NULL))
		{
 
		prev=list;
		list=list->next;
 
		}
 
       }
 
	if(list->info!=deleinfo)
	{
	  printf("Element Not Found");
	}
 
	else
      {
	if(prev==NULL)
	{
	  //temp=temp->next;
	  start=start->next;
	}
 
	else
	{
	  prev->next=list->next;
	}
     }
 
 
}
 
void display()
{
	temp=start;
	while(temp->next!=NULL)
	{
	   printf("%d->",temp->info);
 
	   temp=temp->next;
	}
 
	printf("%d",temp->info);
 
 
}