Singly Linked List & Data Structure

International Institute of Information Technology, I²IT, P-14 Rajiv Gandhi Infotech Park, Hinjawadi, Pune - 411 057
Toll Free - 1800 233 4499 Website - www.isquareit.edu.in ; Email - info@isquareit.edu.in 1
-Varsha Degaonkar
www.isquareit.edu.in

Toll Free - 1800 233 4499 Website - www.isquareit.edu.in ; Email - info@isquareit.edu.in
2

INTRODUCTION
SINGLY LINKED LIST (SLL):
• Singly Linked List is collection of data elements.
• Each element represents a node in SLL.
• Each node consists of
one or more data fields and
one address field which stores the address of next node.
• Operations in SLL:
Creation
Insertion
Display

SINGLY LINKED LIST
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
typedef struct sll
{ int data;
struct sll *next;
}sll;
Structure
definition
Creation of user
defined data
type.

SINGLY LINKED LIST
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
typedef struct sll
{ int data;
struct sll *next;
}sll;
void main()
{
int op;
sll *head=NULL;
clrscr();
Pointer variable declaration of the
Structure and assigning value to it
data *next
Node of SLL:

sll *create(sll *); /*function declaration*/
sll *insert(sll *); /*function declaration*/
void disp(sll *); /*function declaration*/
do // menu driven program
{
printf("1)Createn2)Insertn3) Displayn4)Exit");
printf("nEnter the option: ");
scanf("%d",&op);
switch(op)
{

case 1:
head=create(head);
/*Function Call*/
break;
sll *create(sll *head)
{
sll *p,*nw;
char ans;
do
{
nw=(sll*)malloc(sizeof(sll));nw=500

case 1:
head=create(head);
/*Function Call*/
break;
{
sll *p,*nw;
char ans;
do
{
nw=(sll*)malloc(sizeof(sll));
nw->next=NULL;
NULL
nw=500

case 1:
head=create(head);
/*Function Call*/
break;
{
sll *p,*nw;
char ans;
do
{
nw->next=NULL;
printf("nEnter the data:");
scanf("%d",&(nw->data));
NULL10
nw=500

case 1:
head=create(head);
/*Function Call*/
break;
{
sll *p,*nw;
char ans;
do
{
nw->next=NULL;
if(head==NULL)
NULL10
nw=500

case 1:
head=create(head);
/*Function Call*/
break;
International Institute of Information Technology, I²IT, P-14 Rajiv Gandhi Infotech Park, Hinjawadi, Pune - 411 057 Toll Free - 1800 233 4499 Website - www.isquareit.edu.in ; Email -
info@isquareit.edu.in 11
{
sll *p,*nw;
char ans;
do
{
nw->next=NULL;
if(head==NULL)
p=head=nw;
NULL10
p=head=nw=500

case 1:
head=create(head);
/*Function Call*/
break;
12
{
sll *p,*nw;
char ans;
do
{
nw->next=NULL;
if(head==NULL)
p=head=nw;
else
NULL10
p =head=500
NULL20
nw=600

case 1:
head=create(head);
/*Function Call*/
break;
13
{
sll *p,*nw;
char ans;
do
{
nw->next=NULL;
if(head==NULL)
p=head=nw;
else
{
p->next=nw;
60010
p=head=500
NULL20
nw=600

case 1:
head=create(head);
/*Function Call*/
break;
{
sll *p,*nw;
char ans;
do
{
nw->next=NULL;
if(head==NULL)
p=head=nw;
else
{
p->next=nw;
p=nw;
}
60010
p=head=500
NULL20
p=nw=600

case 1:
head=create(head);
/*Function Call*/
break;
{
sll *p,*nw;
char ans;
do
{ nw=(sll*)malloc(sizeof(sll));
nw->next=NULL;
if(head==NULL)
p=head=nw;
else
{ p->next=nw;
p=nw;
}
printf("nt Do you want to insert node(Y/N)"); flushall();
scanf("%c",&ans);
}while(ans=='y'||ans=='Y');
return(head);
}
60010
head=500
NULL20
p=600
NULL30
nw=700

case 1:
head=create(head);
/*Function Call*/
break;
{
sll *p,*nw;
char ans;
do
nw->next=NULL;
if(head==NULL)
p=head=nw;
else
{ p->next=nw;
p=nw;
}
scanf("%c",&ans);
return(head);
}
60010
head=500
70020
p=600
NULL30
nw=700

case 1:
head=create(head);
/*Function Call*/
break;
{
sll *p,*nw;
char ans;
do
nw->next=NULL;
if(head==NULL)
p=head=nw;
else
{ p->next=nw;
p=nw;
}
scanf("%c",&ans);
return(head);
}
60010
head=500
70020
p=600
NULL30
p=nw=700

case 2:
head= insert(head);
break;
sll *insert(sll *head)
{ sll *p,*q;
int loc,i;
printf("nEnter the location:");
scanf("%d",&loc); //enter location for node insertion
p=(sll*)malloc(sizeof(sll)); //create new node
printf("nenter a data:"); //enter data in node
scanf("%d",&(p->data));
if(loc==1) //Insertion as head node i.e. if position is 1
{
p->next=head;
head=p;
return(head);
}
60010
head=500
70020
600
NULL30
700

case 2:
head= insert(head);
break;
{ sll *p,*q;
int loc,i;
{
p->next=head;
head=p;
return(head);
}
60010
head=500
70020
600
NULL30
700
5
P=400

case 2:
head= insert(head);
break;
{ sll *p,*q;
int loc,i;
{
p->next=head;
head=p;
return(head);
}
60010
head=500
70020
600
NULL30
700
5005
p=head=400

case 2:
head= insert(head);
break;
21
else // if insertion is at other position than head node
{
i=1;q=head;
while(i<loc-1)
{
q=q->next;
i++;
}
p->next=q->next;
q->next=p;
}
disp(head);
return(head);
}
60010
q=head=500
70020
600
NULL30
700
NULL25
p=750

case 2:
head= insert(head);
break;
{
i=1;q=head;
while(i<loc-1)
{
q=q->next;
i++;
}
p->next=q->next;
q->next=p;
}
disp(head);
return(head);
}
60010
q=head=500
70020
q=600
NULL30
700
NULL25
p=750

case 2:
head= insert(head);
break;
{
i=1;q=head;
while(i<loc-1)
{
q=q->next;
i++;
}
p->next=q->next;
q->next=p;
}
disp(head);
return(head);
}
60010
q=head=500
70020
q=600
NULL30
700
70025
p=750

case 2:
head= insert(head);
break;
{
i=1;q=head;
while(i<loc-1)
{
q=q->next;
i++;
}
p->next=q->next;
q->next=p;
}
disp(head);
return(head);
}
60010
q=head=500
75020
q=600
NULL30
700
70025
p=750

case 3:
head= disp(head);
break;
25
void disp(sll *head)
{
sll *p;
if(head==NULL)//if linked list is not created
printf("nEmpty Linked List");
else
{
printf("nn Created SLL:nn ");
for(p=head;p!=NULL;p=p->next)
printf("%d->",p->data);
printf("NULL");
}
}
60010
head=500
70020
600
NULL30
700

case 3:
head= disp(head);
break;
{
sll *p;
else
{
printf("NULL");
}
}
60010
p=head=500
70020
600
10->
NULL30
700

case 3:
head= disp(head);
break;
60010
p=head=500
70020
p=600
10->20->
NULL30
700
{
sll *p;
else
{
printf("NULL");
}
}

case 3:
head= disp(head);
break;
60010
p=head=500
70020
p=600
10->20->30->
NULL30
p=700
{
sll *p;
else
{
printf("NULL");
}
}

case 3:
head= disp(head);
break;
60010
p=head=500
70020
p=600
10->20->30-> NULL
NULL30
p=700 p=NULL
{
sll *p;
else
{
printf("NULL");
}
}

}//end of switch-case
}while(op!=6); //end of Do-while loop
getch();
}//end of main function

ABOUT US
International Institute of Information Technology (I²IT)
P-14, Rajiv Gandhi Infotech Park, Phase – 1, Hinjawadi, Pune – 411057, India
International Institute of Information Technology (I²IT) was established by Late Shri. P. P. Chhabria,
Founder Chairman of Finolex Group of Industries, a well-known philanthropist and former
President of Mahratta Chamber of Commerce, Industries and Agriculture (MCCIA).
I²IT aspires to be an academic leader recognized for innovation, quality teaching and research,
holding high moral values and a forward thinking institution that explores creative approaches
for the future.
 Phone: +91 20 2293 3441 / 2 / 3
Toll Free Line:1800-233-4499
Fax: +91 20 2293 4191
 Email: info@isquareit.edu.in
 Web: www.isquareit.edu.in
32

Singly Linked List & Data Structure

More Related Content

What's hot (20)

Similar to Singly Linked List & Data Structure (20)

More from International Institute of Information Technology (I²IT) (20)

Recently uploaded (20)

Singly Linked List & Data Structure