Linked list is technic to store data in memory it's provide efficiency way to store data
In not contiguous memory allocation.
So user can access data from the memory and implement easily data into the memory.
So the user can access the data insertion ,deletion , updation in easy manner .
There are three of linked list
Types of linked list
Single linked list
Doubly linked list
Circular linked list :
Single linked list have only linked address of data the user can store the data from this address into the memory.
The syntax will be like this:
Struct node {
Int data;
Struct node *next;
}
Doubly linked list :
Doubly linked have double pointer address
First address denotes to the previous data of address .
and next pointer denote to the data address itself.
The syntax of the will be linke this :
Struct node{
Struct node *previous pointer ;
Int data ;
Struct node *next pointer ;
}
Circular linked list :
The circular linked list first Pointing address have the last data pointer address .
I mean that address is denoting to first data this will end of data next address .
For example we can write syntax like this :
Struct node {
Struct node *previous pointer address;
int data ;
Struct node *next pointer address;
}
So I hope understood structure definition of linked list one by one.