Single Linkedlist Operations

Singly linked list
Singly linked list can be defined as the collection of ordered set of elements. The number of elements
may vary according to need of the program. A node in the singly linked list consist of two parts: data
part and link part. Data part of the node stores actual information that is to be represented by the node
while the link part of the node stores the address of its immediate successor.
One way chain or singly linked list can be traversed only in one direction. In other words, we can say that
each node contains only next pointer, therefore we can not traverse the list in the reverse direction.
Consider an example where the marks obtained by the student in three subjects are stored in a linked
list as shown in the figure.
In the above figure, the arrow represents the links. The data part of every node contains the marks
obtained by the student in the different subject. The last node in the list is identified by the null pointer
which is present in the address part of the last node. We can have as many elements we require, in the
data part of the list.
Operations on Singly Linked List
There are various operations which can be performed on singly linked list. A list of all such operations is
given below.
Node Creation
struct node
int data;
struct node *next;

};
struct node *head, *ptr;
ptr = (struct node *)malloc(sizeof(struct node *));
Insertion
The insertion into a singly linked list can be performed at different positions. Based on the position of
the new node being inserted, the insertion is categorized into the following categories.
Deletion and Traversing
The Deletion of a node from a singly linked list can be performed at different positions. Based on the
position of the node being deleted, the operation is categorized into the following categories
Linked List in C: Menu Driven Program
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
};
struct node *head;
void beginsert ();
void lastinsert ();
void randominsert();
void begin_delete();
void last_delete();
void random_delete();
void display();
void search();
void main ()
int choice =0;
while(choice != 9)
printf("\n\n*********Main Menu*********\n");
printf("\nChoose one option from the following list ...\n");
printf("\n===============================================\n");
printf("\n1.Insert in begining\n2.Insert at last\n3.Insert at any random location\n4.Delete from

Beginning\n
5.Delete from last\n6.Delete node after specified location\n7.Search for an

element\n8.Show\n9.Exit\n");
printf("\nEnter your choice?\n");
scanf("\n%d",&choice);
switch(choice)
case 1:
beginsert();
break;
case 2:
lastinsert();
break;
case 3:
randominsert();
break;
case 4:
begin_delete();
break;
case 5:
last_delete();
break;
case 6:
random_delete();
break;
case 7:
search();
break;
case 8:
display();
break;
case 9:
exit(0);
break;
default:
printf("Please enter valid choice..");
void beginsert()
struct node *ptr;
int item;
ptr = (struct node *) malloc(sizeof(struct node *));
if(ptr == NULL)
printf("\nOVERFLOW");
else
printf("\nEnter value\n");
scanf("%d",&item);
ptr->data = item;
ptr->next = head;
head = ptr;
printf("\nNode inserted");
void lastinsert()
struct node *ptr,*temp;
int item;
ptr = (struct node*)malloc(sizeof(struct node));
if(ptr == NULL)
else
printf("\nEnter value?\n");
scanf("%d",&item);
ptr->data = item;
if(head == NULL)
ptr -> next = NULL;
head = ptr;
}
else
temp = head;
while (temp -> next != NULL)
temp = temp -> next;
temp->next = ptr;
ptr->next = NULL;
void randominsert()
int i,loc,item;
struct node *ptr, *temp;
ptr = (struct node *) malloc (sizeof(struct node));
if(ptr == NULL)
else
{
printf("\nEnter element value");
scanf("%d",&item);
ptr->data = item;
printf("\nEnter the location after which you want to insert ");
scanf("\n%d",&loc);
temp=head;
for(i=0;i<loc;i++)
temp = temp->next;
if(temp == NULL)
printf("\ncan't insert\n");
return;
ptr ->next = temp ->next;
temp ->next = ptr;
void begin_delete()
struct node *ptr;

if(head == NULL)
printf("\nList is empty\n");
else
ptr = head;
head = ptr->next;
free(ptr);
printf("\nNode deleted from the begining ...\n");
void last_delete()
struct node *ptr,*ptr1;
if(head == NULL)
printf("\nlist is empty");
else if(head -> next == NULL)
head = NULL;
free(head);
printf("\nOnly node of the list deleted ...\n");
}
else
ptr = head;
while(ptr->next != NULL)
ptr1 = ptr;
ptr = ptr ->next;
ptr1->next = NULL;
free(ptr);
printf("\nDeleted Node from the last ...\n");
void random_delete()
struct node *ptr,*ptr1;
int loc,i;
printf("\n Enter the location of the node after which you want to perform deletion \n");
scanf("%d",&loc);
ptr=head;
for(i=0;i<loc;i++)
ptr1 = ptr;
ptr = ptr->next;
if(ptr == NULL)
printf("\nCan't delete");
return;
ptr1 ->next = ptr ->next;
free(ptr);
printf("\nDeleted node %d ",loc+1);
void search()
struct node *ptr;
int item,i=0,flag;
ptr = head;
if(ptr == NULL)
printf("\nEmpty List\n");
else
printf("\nEnter item which you want to search?\n");
scanf("%d",&item);
while (ptr!=NULL)
{
if(ptr->data == item)
printf("item found at location %d ",i+1);
flag=0;
else
flag=1;
i++;
ptr = ptr -> next;
if(flag==1)
printf("Item not found\n");
void display()
struct node *ptr;
ptr = head;
if(ptr == NULL)
printf("Nothing to print");
else
printf("\nprinting values . . . . .\n");
while (ptr!=NULL)
printf("\n%d",ptr->data);
ptr = ptr -> next;
Output:
*********Main Menu*********
Choose one option from the following list ...
===============================================
1.Insert in begining
2.Insert at last
3.Insert at any random location
4.Delete from Beginning
5.Delete from last
6.Delete node after specified location
7.Search for an element
8.Show
9.Exit
Enter your choice?
Enter value
Node inserted
*********Main Menu*********
===============================================
2.Insert at last
5.Delete from last
8.Show
9.Exit
Enter your choice?
Enter value?
Node inserted
*********Main Menu*********
===============================================
2.Insert at last

5.Delete from last
8.Show
9.Exit
Enter your choice?
Enter element value1
Enter the location after which you want to insert 1
Node inserted
*********Main Menu*********
===============================================
2.Insert at last

5.Delete from last
8.Show
9.Exit
Enter your choice?
printing values . . . . .
*********Main Menu*********
===============================================
2.Insert at last

5.Delete from last
8.Show
9.Exit
Enter your choice?
Enter value?
123
Node inserted
*********Main Menu*********
===============================================
2.Insert at last

5.Delete from last
8.Show
9.Exit
Enter your choice?
Enter value
1234
Node inserted
*********Main Menu*********
===============================================
2.Insert at last
5.Delete from last

8.Show
9.Exit
Enter your choice?
Node deleted from the begining ...
*********Main Menu*********
===============================================
2.Insert at last
5.Delete from last
8.Show
9.Exit
Enter your choice?
Deleted Node from the last ...
*********Main Menu*********
===============================================
2.Insert at last
5.Delete from last
8.Show
9.Exit
Enter your choice?
6
Enter the location of the node after which you want to perform deletion
Deleted node 2
*********Main Menu*********
===============================================
2.Insert at last
5.Delete from last
8.Show
9.Exit
Enter your choice?
printing values . . . . .
1
*********Main Menu*********
===============================================
2.Insert at last
5.Delete from last
8.Show
9.Exit
Enter your choice?
Enter item which you want to search?
1
item found at location 1
item found at location 2
*********Main Menu*********
===============================================
2.Insert at last
5.Delete from last
8.Show
9.Exit
Enter your choice?

Single Linkedlist Operations

Uploaded by

Copyright:

Available Formats

Single Linkedlist Operations

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Single Linkedlist Operations

Uploaded by

Copyright:

Available Formats

Singly linked list

Operations on Singly Linked List

struct node *next;

struct node *head, *ptr;

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

Deletion and Traversing

struct node *next;

struct node *head;

void beginsert ();

void lastinsert ();

int choice =0;

printf("\nChoose one option from the following list ...\n");

printf("\n1.Insert in begining\n2.Insert at last\n3.Insert at any random location\n4.Delete from

5.Delete from last\n6.Delete node after specified location\n7.Search for an

printf("Please enter valid choice..");

struct node *ptr;

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

struct node *ptr,*temp;

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

ptr -> next = NULL;

while (temp -> next != NULL)

temp = temp -> next;

struct node *ptr, *temp;

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

printf("\nEnter element value");

printf("\nEnter the location after which you want to insert ");

ptr ->next = temp ->next;

temp ->next = ptr;

struct node *ptr;

printf("\nNode deleted from the begining ...\n");

struct node *ptr,*ptr1;

else if(head -> next == NULL)

printf("\nOnly node of the list deleted ...\n");

ptr = ptr ->next;

printf("\nDeleted Node from the last ...\n");

struct node *ptr,*ptr1;

ptr1 ->next = ptr ->next;

printf("\nDeleted node %d ",loc+1);

struct node *ptr;

printf("\nEnter item which you want to search?\n");

printf("item found at location %d ",i+1);

ptr = ptr -> next;

printf("Item not found\n");

struct node *ptr;

printf("\nprinting values . . . . .\n");

ptr = ptr -> next;

Choose one option from the following list ...

3.Insert at any random location

4.Delete from Beginning

5.Delete from last

6.Delete node after specified location

7.Search for an element

Enter your choice?

Choose one option from the following list ...

4.Delete from Beginning

5.Delete from last

6.Delete node after specified location

7.Search for an element

Enter your choice?

struct node head, ptr;

ptr = (struct node )malloc(sizeof(struct node ));

ptr = (struct node ) malloc(sizeof(struct node ));

struct node ptr,temp;

struct node ptr, temp;

struct node ptr,ptr1;

struct node ptr,ptr1;