Linked List Insertion Implement a function to insert an ITEM (X) before the given ITEM(Y) Example: Linked List: 7 -> 5 -> 8 -> 2-> 9 Insert X = 1 before Y = 2 Output: 7-> 5-> 8-> 1-> 2-> 9 Case 2: X= 1 Y = 7 Output: 1-> 7-> 5-> 8-> 2-> 9 Case 3: X= 1 Y = 4 //element is not present Output: 1-> 7-> 5-> 8-> 2-> 9 #include #include using namespace std; struct node { int data; node* link; }; node* start = NULL; void print() { node* ptr = start; cout<<"\n\n\tLINKED LIST\n\n"; while(ptr != NULL) { cout<data <<"\t"; ptr = ptr->link; } } void insert_after_loc(node *loc, int item) { node *NEW = new node; NEW->data = item; if(loc == NULL) { NEW->link = start; start = NEW; } else { NEW->link = loc->link; loc->link = NEW; } } void insert_sorted(int item) { node *loc; if(start == NULL) loc = NULL; node *save = NULL, *ptr = start; while( ptr != NULL && ptr->data < item) { save = ptr; ptr = ptr->link; } loc = save; insert_after_loc(loc, item); } void insert_X_before_Y(int x, int y) { //Write your code } int main() { int n; cout<<"\nEnter the number of elements you want to insert:\t"; cin>>n; int item; for(int i=0; i>item; insert_sorted(item);
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Linked List Insertion
Implement a function to insert an ITEM (X) before the given ITEM(Y)
Example:
Linked List: 7 -> 5 -> 8 -> 2-> 9
Insert X = 1
before
Y = 2
Output:
7-> 5-> 8-> 1-> 2-> 9
Case 2:
X= 1
Y = 7
Output: 1-> 7-> 5-> 8-> 2-> 9
Case 3:
X= 1
Y = 4 //element is not present
Output: 1-> 7-> 5-> 8-> 2-> 9
#include<iostream>
#include<conio.h>
using namespace std;
struct node
{
int data;
node* link;
};
node* start = NULL;
void print()
{
node* ptr = start;
cout<<"\n\n\tLINKED LIST\n\n";
while(ptr != NULL)
{
cout<<ptr->data <<"\t";
ptr = ptr->link;
}
}
void insert_after_loc(node *loc, int item)
{
node *NEW = new node;
NEW->data = item;
if(loc == NULL)
{
NEW->link = start;
start = NEW;
}
else
{
NEW->link = loc->link;
loc->link = NEW;
}
}
void insert_sorted(int item)
{
node *loc;
if(start == NULL)
loc = NULL;
node *save = NULL, *ptr = start;
while( ptr != NULL && ptr->data < item)
{
save = ptr;
ptr = ptr->link;
}
loc = save;
insert_after_loc(loc, item);
}
void insert_X_before_Y(int x, int y)
{
//Write your code
}
int main()
{
int n;
cout<<"\nEnter the number of elements you want to insert:\t";
cin>>n;
int item;
for(int i=0; i<n; i++)
{
cout<<"\nEnter the ITEM:\t";
cin>>item;
insert_sorted(item);
}
print();
getch();
return 0;
}
Step by step
Solved in 4 steps with 2 images
