Linked list program in c++ insert delete and between
#include<iostream>
using namespace std;
void insertAtBeginning(int);
void insertAtEnd(int);
void insertBetween(int,int,int);
void display();
void removeBeginning();
void removeEnd();
void removeSpecific(int);
struct Node
{
int data;
struct Node *next;
}*head = NULL;
int main()
{
int choice,value,choice1,loc1,loc2;
//clrscr();
while(1){
mainMenu: cout<<("\n\n****** MENU ******\n1. Insert\n2. Display\n3. Delete\n4. Exit\nEnter your choice: ");
cin>>choice;
switch(choice)
{
case 1: cout<<("Enter the value to be insert: ");
cin>>value;
while(1){
cout<<("Where you want to insert: \n1. At Beginning\n2. At End\n3. Between\nEnter your choice: ");
cin>>choice1;
switch(choice1)
{
case 1: insertAtBeginning(value);
break;
case 2: insertAtEnd(value);
break;
case 3: cout<<("Enter the two values where you wanto insert: ");
cin>>loc1,&loc2;
insertBetween(value,loc1,loc2);
break;
default: cout<<("\nWrong Input!! Try again!!!\n\n");
goto mainMenu;
}
goto subMenuEnd;
}
subMenuEnd:
break;
case 2: display();
break;
case 3: cout<<("How do you want to Delete: \n1. From Beginning\n2. From End\n3. Spesific\nEnter your choice: ");
cin>>choice1;
switch(choice1)
{
case 1: removeBeginning();
break;
case 2: removeEnd();
break;
case 3: cout<<("Enter the value which you wanto delete: ");
cin>>loc2;
removeSpecific(loc2);
break;
default: cout<<("\nWrong Input!! Try again!!!\n\n");
goto mainMenu;
}
break;
case 4: exit(0);
default: cout<<("\nWrong input!!! Try again!!\n\n");
}
}
}
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;
}
cout<<("\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;
}
cout<<("\nOne node inserted!!!\n");
}
void insertBetween(int value, int loc1, int loc2)
{
struct Node *newNode;
newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->data = value;
if(head == NULL)
{
newNode->next = NULL;
head = newNode;
}
else
{
struct Node *temp = head;
while(temp->data != loc1 && temp->data != loc2)
temp = temp->next;
newNode->next = temp->next;
temp->next = newNode;
}
cout<<("\nOne node inserted!!!\n");
}
void removeBeginning()
{
if(head == NULL)
cout<<("\n\nList is Empty!!!");
else
{
struct Node *temp = head;
if(head->next == NULL)
{
head = NULL;
free(temp);
}
else
{
head = temp->next;
free(temp);
cout<<("\nOne node deleted!!!\n\n");
}
}
}
void removeEnd()
{
if(head == NULL)
{
cout<<("\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);
cout<<("\nOne node deleted!!!\n\n");
}
}
void removeSpecific(int delValue)
{
struct Node *temp1 = head, *temp2;
while(temp1->data != delValue)
{
if(temp1 -> next == NULL){
cout<<("\nGiven node not found in the list!!!");
goto functionEnd;
}
temp2 = temp1;
temp1 = temp1 -> next;
}
temp2 -> next = temp1 -> next;
free(temp1);
cout<<("\nOne node deleted!!!\n\n");
functionEnd:;
}
void display()
{
if(head == NULL)
{
cout<<("\nList is Empty\n");
}
else
{
struct Node *temp = head;
cout<<("\n\nList elements are - \n");
while(temp->next != NULL)
{
cout<<temp->data;
temp = temp->next;
}
cout<<temp->data;
}
}
Comments
Post a Comment