Singly Linked List

Linked List
• A list implemented by each item having a link

to the next item.
• Head points to the first node.
• Last node points to NULL.
P Node A Node B Node C Node D
10 20 30 10 NULL
Node
• Linked List is a series of nodes.
• Each node consists of 2 parts viz. Data part &
pointer part.
• Pointer part stores the address of next node.
NODE
10
DATA POINTER
Declarations
• p : always points to the first node
• q: used for traversing the list, initialised with p
• temp : used for refering the newly created node
• link: points to the address of the next node
– Eg: q->link
• data: consists data of a node
– E.g: q->data
• num: Number entered by the user
• position: indicates the position of the node
• counter: counts the no of node
Structure
• Declare Node struct for nodes
– data: int-type data in this example
– next: a pointer to the next node in the list
struct node
{
int data; //data
struct node *link; // pointer
};
ADD
• If list is empty i.e. P==NULL then create a new
node with data and set its pointer to NULL
• If list is not empty i.e. P!=NULL then
– Traverse till the last node
– create a node with data
– set its pointer to NULL
If list is empty i.e. P==NULL
• struct node *P=null;
• struct node *q=p;
P Q
NULL
P Q
NULL
P Q
p=(struct node *) malloc(sizeof(struct node))

P Q
P->data=num 10

P Q
P->data=num 10 NULL P->link=NULL

If list is not empty i.e. p!=NULL
P Q
Node A Node B Node C
10 20 30 NULL
o Traversal : true
while(q->link!=NULL)
q=q->link;
P Q
10 20 30 NULL
o Traversal : false
while(q->link!=NULL)
q=q->link;
P Q
10 20 30 NULL
o Creating a node :
q->link=(struct node *) malloc(sizeof(struct node))
q->link->data=num
q->link->link=NULL
P Q
Node A Node B Node C Node D
10 20 30 10 NULL
DISPLAY
• If P==NULL then list is empty
• Else
– Traverse till the last node
while(q!=NULL)
{
printf("\n%d: data=%d",i,q->data);
q=q->link;
}
If list is empty
• struct node *P=null;
• struct node *q=p;
• If(p==NULL)
o/p : list is empty
P Q
NULL
o Traversal & output : true
while(q!=NULL)
{
printf(“%d ”,q->data);
q=q->link;
}
P Q
10 20 30 NULL
o/p : 10 o/p : 20
o Traversal & output :
while(q!=NULL)
{
q=q->link;
}
P Q
10 20 30 NULL
o/p : 10 o/p : 20 o/p : 30

o Traversal & output : false
while(q!=NULL)
{
q=q->link;
}
P Q
10 20 30 NULL
o/p : 10 o/p : 20 o/p : 30

INSERT
• If position is 1 then create a node with data
and set its pointer to first node i.e. q as it also
points to first node.
• If position is after the first node then traverse
till the node before the insertion position
where the node is to be inserted. Save the link
of previous node in a temp. Overwrite the
If position is 1
Q
P
10 20 30 NULL
If position is 1
Q
P
10 20 30 NULL
p=(struct node *) malloc(sizeof(struct node));

If position is 1
Q
P
10 20 30 NULL
p->data=num 5

If position is 1
Q
P
10 20 30 NULL
p->data=num; 5
p->link=q;

If position is greater than 1
Suppose a node is to be inserted at position 3.
Q
P
10 20 30 NULL
for(i=1;i<=3-2;i++)
{
q=q->link;
}
P Q
10 20 30 NULL
for(i=1;i<=3-2;i++)
{
q=q->link;
}
P Q
10 20 30 NULL
temp
for(i=1;i<=3-2;i++)
{
q=q->link;
}
P Q
10 20 30 NULL
temp
for(i=1;i<=3-2;i++)
{
q=q->link; q->link=(struct node *) malloc(sizeof(struct node));
}
P Q
Node A Node B Node BC Node C
10 20 30 NULL
temp
for(i=1;i<=3-2;i++)
{
}
P Q
10 20 25 30 NULL
q->
link
- >da
ta=
n um
;
temp
for(i=1;i<=3-2;i++)
{
}
P Q
10 20 25 30 NULL
q->
link q->link->link=temp;
- >da
ta=
n um
;
temp
COUNT
• Initialise counter=0;
• Traverse till q!=NULL by q=q->link &
simultaneously increment the counter with 1
• Return the value of counter
o Traversal & count : true
counter=0;
while(q!=NULL)
{
counter++;
q=q->link;
}
return counter;
P Q
10 20 30 NULL
counter= 1 counter=2
o Traversal & count :
counter=0;
while(q!=NULL)
{
counter++;
q=q->link;
}
return counter;
P Q
10 20 30 NULL
counter=1 counter=2 counter=3

o Traversal & count : false
counter=0;
while(q!=NULL)
{
counter++;
q=q->link;
}
return counter;
P Q
10 20 30 NULL
counter=1 counter=2 counter=3

REVERSE
struct node *q=p;
int i,k,l,no_of_nodes;
• Traverse till the no of
no_of_nodes=k=l=count(); nodes i.e till last node
for(i=1;i<=no_of_nodes;i++)
{
on first attempt.
for(k=1;k<l;k++) • After first attempt keep
{
q=q->link;
traversing by reducing
} the traversal with 1 &
printf("%d ",q->data);
q=p;
display the output.
l--;
}
SEARCH
• num is the number to be searched
• position =1
• Traverse the list till the last node & keep
comparing the values of list with num the
moment it matches return the position which
is incremented by everytime.
• Return -1 if the no is not found
SEARCH
• Suppose 30 is to be searched.
• position=1;
• while(q!=NULL) {
if(q->data==num)
return(position);
position++;
q=q->link; }
P Q
10 20 30 40 NULL
position=1 position=2 position=3 position=4

SEARCH
• Suppose 30 is to be searched.
• position=1;
• while(q!=NULL) {
true
if(q->data==num)
return(position);
position++;
q=q->link; }
P Q
10 20 30 40 NULL
position=1 position=2 position=3 position=4

REMOVE
• If position is 1
• Position is other than 1
If position is 1
P Q
10 20 30 10 NULL
If position is 1
• p=p->link
P Q
10 20 30 10 NULL
If position is 1
P Q
10 20 30 10 NULL
If position is 1
• free(q)
P Q
Node B Node C Node D
20 30 10 NULL
• Suppose 3 node is to be removed, position=3
• for(i=1;i<=position-2;i++)
{
q=q->link;
}
P Q
10 20 30 40 NULL
{
q=q->link;
}
P Q
10 20 30 40 NULL
{
q=q->link;
}
P Q
10 20 30 40 NULL
q->link=q->link->link;
Traversal & comparison:
SORTING
for(i=p;i!=NULL;i=i->link)
{
for(j=i->link;j!=NULL;j=j->link)
{
if(i->data>j->data)
{
temp=i->data;
i->data=j->data;
j->data=temp;
}
}
}
i j
7 6 3 1 NULL
SORTING
{
{
if(i->data>j->data)
{
temp=i->data;
i->data=j->data;
j->data=temp;
}
}
}
i j
7 6 3 1 NULL
SORTING
{
{
if(i->data>j->data)
{
temp=i->data;
i->data=j->data;
j->data=temp;
}
}
}
i j
6 7 3 1 NULL
SORTING
{
{
if(i->data>j->data)
{
temp=i->data;
i->data=j->data;
j->data=temp;
}
}
}
i j
3 7 6 1 NULL
SORTING
{
{
if(i->data>j->data)
{
temp=i->data;
i->data=j->data;
j->data=temp;
}
}
}
i j
3 7 6 1 NULL
SORTING
{
{
if(i->data>j->data)
{
temp=i->data;
i->data=j->data;
j->data=temp;
}
}
}
i j
1 7 6 3 NULL
SORTING
{
{
if(i->data>j->data)
{
temp=i->data;
i->data=j->data;
j->data=temp;
}
}
}
i j
1 6 7 3 NULL
SORTING
{
{
if(i->data>j->data)
{
temp=i->data;
i->data=j->data;
j->data=temp;
}
}
}
i j
1 3 7 6 NULL
SORTING
{
{
if(i->data>j->data)
{
temp=i->data;
i->data=j->data;
j->data=temp;
}
}
}
i j
1 3 7 6 NULL
SORTING
{
{
if(i->data>j->data)
{
temp=i->data;
i->data=j->data;
j->data=temp;
}
}
}
i j
1 3 6 7 NULL
Presented by
• Jasbirsingh chauhan

Singly Linked List

Diunggah oleh

Informasi Dokumen

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

Singly Linked List

Diunggah oleh

Hak Cipta:

Format Tersedia

Linked List

• A list implemented by each item having a link

p=(struct node *) malloc(sizeof(struct node))

p=(struct node *) malloc(sizeof(struct node))

P->data=num 10 NULL P->link=NULL

p=(struct node *) malloc(sizeof(struct node))

o/p : 10 o/p : 20 o/p : 30

o/p : 10 o/p : 20 o/p : 30

p=(struct node *) malloc(sizeof(struct node));

p=(struct node *) malloc(sizeof(struct node));

p=(struct node *) malloc(sizeof(struct node));

counter=1 counter=2 counter=3

counter=1 counter=2 counter=3

position=1 position=2 position=3 position=4

position=1 position=2 position=3 position=4

Node A Node B Node C Node D

Node A Node B Node C Node D

Node A Node B Node C Node D

Node A Node B Node C Node D

Node A Node B Node C Node D

Node A Node B Node C Node D

Node A Node B Node C Node D

Node A Node B Node C Node D

Node A Node B Node C Node D

Node A Node B Node C Node D

Anda mungkin juga menyukai