C Program to implement Circular linked list
Write a C Program to implement Circular linked list operations. Here’s simple Menu Driven C Program to implement circular linked list operations like Creation, Insertion, Deletion, Display, Count, Add Node, Delete Node, Search, Reverse, etc. in C Programming Language.
What is Linked List ?
Linked list is a linear data structure that contains sequence of elements such that each element links to its next element in the sequence. Each link contains a connection to another link.
Following are the important terms to understand the concept of Linked List.
- Link − Each link of a linked list can store a data called an element.
- Next − Each link of a linked list contains a link to the next link called Next.
Each element in a linked list is called as “Node”. Each node consists of its own data and the address of the next node and forms a chain. Linked Lists are used to create trees and graphs.
Basic Operations
Following are the basic operations supported by a list.
- Insertion − Adds an element at the beginning of the list.
- Deletion − Deletes an element at the beginning of the list.
- Display − Displays the complete list.
- Search − Searches an element using the given key.
- Delete − Deletes an element using the given key.
Below is the source code for C Program to implement circular linked list operations which is successfully compiled and run on Windows System to produce desired output as shown below :
SOURCE CODE : :
/* C Program of implement circular linked list*/
#include<stdio.h>
#include<stdlib.h>
struct node
{
int info;
struct node *link;
};
struct node *create_list(struct node *last);
void display(struct node *last);
struct node *addtoempty(struct node *last,int data);
struct node *addatbeg(struct node *last,int data);
struct node *addatend(struct node *last,int data);
struct node *addafter(struct node *last,int data,int item);
struct node *del(struct node *last,int data);
int main( )
{
int choice,data,item;
struct node *last=NULL;
while(1)
{
printf("\n\n1.Create List\n");
printf("2.Display\n");
printf("3.Add to empty list\n");
printf("4.Add at beginning\n");
printf("5.Add at end\n");
printf("6.Add after \n");
printf("7.Delete\n");
printf("8.Quit\n");
printf("\nEnter your choice : ");
scanf("%d",&choice);
switch(choice)
{
case 1:
last=create_list(last);
break;
case 2:
display(last);
break;
case 3:
printf("\nEnter the element to be inserted : ");
scanf("%d",&data);
last=addtoempty(last,data);
break;
case 4:
printf("\nEnter the element to be inserted : ");
scanf("%d",&data);
last=addatbeg(last,data);
break;
case 5:
printf("\nEnter the element to be inserted : ");
scanf("%d",&data);
last=addatend(last,data);
break;
case 6:
printf("\nEnter the element to be inserted : ");
scanf("%d",&data);
printf("\nEnter the element after which to insert : ");
scanf("%d",&item);
last=addafter(last,data,item);
break;
case 7:
printf("\nEnter the element to be deleted : ");
scanf("%d",&data);
last=del(last,data);
break;
case 8:
exit(1);
default:
printf("\nWrong choice\n");
}/*End of switch*/
}/*End of while*/
return 0;
}/*End of main( )*/
struct node *create_list(struct node *last)
{
int i,n,data;
printf("\nEnter the number of nodes : ");
scanf("%d",&n);
last=NULL;
if(n==0)
return last;
printf("Enter the element to be inserted : ");
scanf("%d",&data);
last=addtoempty(last,data);
for(i=2;i<=n;i++)
{
printf("Enter the element to be inserted : ");
scanf("%d",&data);
last=addatend(last,data);
}
return last;
}/*End of create_list()*/
struct node *addtoempty(struct node *last,int data)
{
struct node *tmp;
tmp=(struct node *)malloc(sizeof(struct node));
tmp->info=data;
last=tmp;
last->link=last;
return last;
}/*End of addtoempty( )*/
struct node *addatbeg(struct node *last,int data)
{
struct node *tmp;
tmp=(struct node *)malloc(sizeof(struct node));
tmp->info=data;
tmp->link=last->link;
last->link=tmp;
return last;
}/*End of addatbeg( )*/
struct node *addatend(struct node *last,int data)
{
struct node *tmp;
tmp=(struct node *)malloc(sizeof(struct node));
tmp->info=data;
tmp->link=last->link;
last->link=tmp;
last=tmp;
return last;
}/*End of addatend( )*/
struct node *addafter(struct node *last,int data,int item)
{
struct node *tmp,*p;
p=last->link;
do
{
if(p->info==item)
{
tmp=(struct node *)malloc(sizeof(struct node));
tmp->info=data;
tmp->link=p->link;
p->link=tmp;
if(p==last)
last=tmp;
return last;
}
p=p->link;
}while(p!=last->link);
printf("%d not present in the list\n",item);
return last;
}/*End of addafter()*/
struct node *del(struct node *last,int data)
{
struct node *tmp,*p;
if(last==NULL)
{
printf("List is empty\n");
return last;
}
/*Deletion of only node*/
if(last->link==last && last->info==data)
{
tmp=last;
last=NULL;
free(tmp);
return last;
}
/*Deletion of first node*/
if(last->link->info==data)
{
tmp=last->link;
last->link=tmp->link;
free(tmp);
return last;
}
/*Deletion in between*/
p=last->link;
while(p->link!=last)
{
if(p->link->info==data)
{
tmp=p->link;
p->link=tmp->link;
free(tmp);
return last;
}
p=p->link;
}
/*Deletion of last node*/
if(last->info==data)
{
tmp=last;
p->link=last->link;
last=p;
free(tmp);
return last;
}
printf("\nElement %d not found\n",data);
return last;
}/*End of del( )*/
void display(struct node *last)
{
struct node *p;
if(last==NULL)
{
printf("\nList is empty\n");
return;
}
p=last->link;
do
{
printf("%d ",p->info);
p=p->link;
}while(p!=last->link);
printf("\n");
}/*End of display( )*/
OUTPUT : :
************* OUTPUT ***************** 1.Create List 2.Display 3.Add to empty list 4.Add at beginning 5.Add at end 6.Add after 7.Delete 8.Quit Enter your choice : 1 Enter the number of nodes : 3 Enter the element to be inserted : 1 Enter the element to be inserted : 2 Enter the element to be inserted : 3 1.Create List 2.Display 3.Add to empty list 4.Add at beginning 5.Add at end 6.Add after 7.Delete 8.Quit Enter your choice : 2 1 2 3 1.Create List 2.Display 3.Add to empty list 4.Add at beginning 5.Add at end 6.Add after 7.Delete 8.Quit Enter your choice : 3 Enter the element to be inserted : 2 1.Create List 2.Display 3.Add to empty list 4.Add at beginning 5.Add at end 6.Add after 7.Delete 8.Quit Enter your choice : 2 2 1.Create List 2.Display 3.Add to empty list 4.Add at beginning 5.Add at end 6.Add after 7.Delete 8.Quit Enter your choice : 4 Enter the element to be inserted : 1 1.Create List 2.Display 3.Add to empty list 4.Add at beginning 5.Add at end 6.Add after 7.Delete 8.Quit Enter your choice : 2 1 2 1.Create List 2.Display 3.Add to empty list 4.Add at beginning 5.Add at end 6.Add after 7.Delete 8.Quit Enter your choice : 5 Enter the element to be inserted : 3 1.Create List 2.Display 3.Add to empty list 4.Add at beginning 5.Add at end 6.Add after 7.Delete 8.Quit Enter your choice : 2 1 2 3 1.Create List 2.Display 3.Add to empty list 4.Add at beginning 5.Add at end 6.Add after 7.Delete 8.Quit Enter your choice : 6 Enter the element to be inserted : 4 Enter the element after which to insert : 3 1.Create List 2.Display 3.Add to empty list 4.Add at beginning 5.Add at end 6.Add after 7.Delete 8.Quit Enter your choice : 2 1 2 3 4 1.Create List 2.Display 3.Add to empty list 4.Add at beginning 5.Add at end 6.Add after 7.Delete 8.Quit Enter your choice : 7 Enter the element to be deleted : 1 1.Create List 2.Display 3.Add to empty list 4.Add at beginning 5.Add at end 6.Add after 7.Delete 8.Quit Enter your choice : 2 2 3 4 1.Create List 2.Display 3.Add to empty list 4.Add at beginning 5.Add at end 6.Add after 7.Delete 8.Quit Enter your choice : 8
If you found any error or any queries related to the above program or any questions or reviews , you wanna to ask from us ,you may Contact Us through our contact Page or you can also comment below in the comment section.We will try our best to reach upto you in the short interval.
Thanks for reading the post….