Notes

#include <stdlib.h>
#include<stdio.h>
#include<conio.h>

void insertAtBeginning(int);
void insertAtEnd(int);
void insertBetween(int,int);
void display();
void removeBeginning();
void removeEnd();
void removeSpecific(int);

struct Node
{
int data;
struct Node *next;
}*head = NULL;

int main()
{
// clrscr();
int choice,value,choice1,loc1,loc2;

while(1){
mainMenu: printf("nn********* MENU ************n1. Insertn2. Displayn3. Deleten4. ExitnEnter your choice: ");
scanf("%d",&choice);
switch(choice)
{
case 1: printf("Enter the value to be insert: ");
scanf("%d",&value);
while(1){
printf("Where you want to insert: n1. At Beginningn2. At Endn3. BetweennEnter your choice: ");
scanf("%d",&choice1);
switch(choice1)
{
case 1: insertAtBeginning(value);
break;
case 2: insertAtEnd(value);
break;
case 3: printf("Enter the values where you want to insert: ");
scanf("%d",&loc1);
insertBetween(value,loc1);
break;
default: printf("nWrong Input!! Try again!!!nn");
goto mainMenu;
}
goto subMenuEnd;
}
subMenuEnd:
break;
case 2: display();
break;
case 3: printf("How do you want to Delete: n1. From Beginningn2. From Endn3. SpesificnEnter your choice: ");
scanf("%d",&choice1);
switch(choice1)
{
case 1: removeBeginning();
break;
case 2: removeEnd(value);
break;
case 3: printf("Enter the value which you want to delete: ");
scanf("%d",&loc2);
removeSpecific(loc2);
break;
default: printf("nWrong Input!! Try again!!!nn");
goto mainMenu;
}
break;
case 4: exit(0);
default: printf("nWrong input!!! Try again!!nn");
}
}
}

void insertAtBeginning(int value)
{
struct Node *newNode;
newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->data = value;
if(head == NULL)
{
newNode->next = NULL;
head = newNode;
}
else
{
newNode->next = head;
head = newNode;
}
printf("nOne node inserted!!!n");
}
void insertAtEnd(int value)
{
struct Node *newNode;
newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->data = value;
newNode->next = NULL;
if(head == NULL)
head = newNode;
else
{
struct Node *temp = head;
while(temp->next != NULL)
temp = temp->next;
temp->next = newNode;
}
printf("nOne node inserted!!!n");
}
void insertBetween(int value, int loc1)
{
struct Node *newNode;
newNode = malloc(sizeof(struct Node));
newNode->data = value;
struct Node *temp = head;
int i;
for( i=2; i< loc1; i++) {
if(temp->next != NULL) {
temp = temp->next;
}
}
newNode->next = temp->next;
temp->next = newNode;
printf("nOne node inserted!!!n");
}
void removeBeginning()
{
if(head == NULL)
printf("nnList is Empty!!!");
else
{
struct Node *temp = head;
if(head->next == NULL)
{
head = NULL;
free(temp);
}
else
{
head = temp->next;
free(temp);
printf("nOne node deleted!!!nn");
}
}
}
void removeEnd()
{
if(head == NULL)
{
printf("nList is Empty!!!n");
}
else
{
struct Node *temp1 = head,*temp2;
if(head->next == NULL)
head = NULL;
else
{
while(temp1->next != NULL)
{
temp2 = temp1;
temp1 = temp1->next;
}
temp2->next = NULL;
}
free(temp1);
printf("nOne node deleted!!!nn");
}
}
void removeSpecific(int delValue)
{
struct Node *temp1 = head, *temp2;
while(temp1->data != delValue)
{
if(temp1 -> next == NULL){
printf("nGiven node not found in the list!!!");
goto functionEnd;
}
temp2 = temp1;
temp1 = temp1 -> next;
}
temp2 -> next = temp1 -> next;
free(temp1);
printf("nOne node deleted!!!nn");
functionEnd:
printf("nthanxnn");
}
void display()
{
if(head == NULL)
{
printf("nList is Emptyn");
}
else
{
struct Node *temp = head;
printf("nnList elements are - n");
while(temp->next != NULL)
{
printf("%d --->",temp->data);
temp = temp->next;
}
printf("%d --->NULL",temp->data);
}
}