Write a C Program to implement singly linked list operations

By | 26.03.2017

C Program to implement singly linked list


Write a C Program to implement singly linked list operations. Here’s simple Menu Driven Program to to implement singly 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.
  • LinkedList − A Linked List contains the connection link to the first link called First.

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 singly linked list operations which is successfully compiled and run on Windows System to produce desired output as shown below :


SOURCE CODE : :


/*  C Program to implement singly linked list operations */


#include<stdio.h>
#include<stdlib.h>

struct node
{
        int info;
        struct node *link;
};

struct node *create_list(struct node *start);
void display(struct node *start);
void count(struct node *start);
void search(struct node *start,int data);
struct node *addatbeg(struct node *start,int data);
struct node *addatend(struct node *start,int data);
struct node *addafter(struct node *start,int data,int item);
struct node *addbefore(struct node *start,int data,int item );
struct node *addatpos(struct node *start,int data,int pos);
struct node *del(struct node *start,int data);
struct node *reverse(struct node *start);

int main()
{
        struct node *start=NULL;
        int choice,data,item,pos;

        while(1)
        {
                printf("1.Create List\n");
                printf("2.Display\n");
                printf("3.Count\n");
                printf("4.Search\n");
                printf("5.Add to empty list / Add at beginning\n");
                printf("6.Add at end\n");
                printf("7.Add after node\n");
                printf("8.Add before node\n");
                printf("9.Add at position\n");
                printf("10.Delete\n");
                printf("11.Reverse\n");
                printf("12.Quit\n\n");

                printf("Enter your choice : ");
                scanf("%d",&choice);

                switch(choice)
                {
                 case 1:
                        start=create_list(start);
                        break;
                 case 2:
                        display(start);
                        break;
                 case 3:
                        count(start);
                        break;
                 case 4:
                        printf("Enter the element to be searched : ");
                        scanf("%d",&data);
                        search(start,data);
                        break;
                 case 5:
                        printf("Enter the element to be inserted : ");
                        scanf("%d",&data);
                        start=addatbeg(start,data);
                        break;
                 case 6:
                        printf("Enter the element to be inserted : ");
                        scanf("%d",&data);
                        start=addatend(start,data);
                        break;
                 case 7:
                        printf("Enter the element to be inserted : ");
                        scanf("%d",&data);
                        printf("Enter the element after which to insert : ");
                        scanf("%d",&item);
                        start=addafter(start,data,item);
                        break;
                 case 8:
                        printf("Enter the element to be inserted : ");
                        scanf("%d",&data);
                        printf("Enter the element before which to insert : ");
                        scanf("%d",&item);
                        start=addbefore(start,data,item);
                        break;
                 case 9:
                        printf("Enter the element to be inserted : ");
                        scanf("%d",&data);
                        printf("Enter the position at which to insert : ");
                        scanf("%d",&pos);
                        start=addatpos(start,data,pos);
                        break;
                 case 10:
                        printf("Enter the element to be deleted : ");
                        scanf("%d",&data);
                        start=del(start, data);
                        break;
                 case 11:
                        start=reverse(start);
                        break;
                 case 12:
                         exit(1);
                 default:
                         printf("Wrong choice\n");
                }/*End of switch */
        }/*End of while */

        return 0;
}/*End of main()*/

struct node *create_list(struct node *start)
{
        int i,n,data;
        printf("Enter the number of nodes : ");
        scanf("%d",&n);
        start=NULL;
        if(n==0)
                return start;

        printf("Enter the element to be inserted : ");
        scanf("%d",&data);
        start=addatbeg(start,data);

        for(i=2;i<=n;i++)
        {
                printf("Enter the element to be inserted : ");
                scanf("%d",&data);
                start=addatend(start,data);
        }
        return start;
}/*End of create_list()*/

void display(struct node *start)
{
        struct node *p;
        if(start==NULL)
        {
                printf("List is empty\n");
                return;
        }
        p=start;
        printf("List is :\n");
        while(p!=NULL)
        {
                printf("%d ",p->info);
                p=p->link;
        }
        printf("\n\n");
}/*End of display() */

void count(struct node *start)
{
        struct node *p;
        int cnt=0;
        p=start;
        while(p!=NULL)
        {
                p=p->link;
                cnt++;
        }
        printf("Number of elements are %d\n",cnt);
}/*End of count() */

void search(struct node *start,int item)
{
        struct node *p=start;
        int pos=1;
        while(p!=NULL)
        {
                if(p->info==item)
                {
                        printf("Item %d found at position %d\n",item,pos);
                        return;
                }
                p=p->link;
                pos++;
        }
        printf("Item %d not found in list\n",item);
}/*End of search()*/

struct node *addatbeg(struct node *start,int data)
{
        struct node *tmp;
        tmp=(struct node *)malloc(sizeof(struct node));
        tmp->info=data;
        tmp->link=start;
        start=tmp;
        return start;
}/*End of addatbeg()*/

struct node *addatend(struct node *start,int data)
{
        struct node *p,*tmp;
        tmp=(struct node *)malloc(sizeof(struct node));
        tmp->info=data;
        p=start;
        while(p->link!=NULL)
                p=p->link;
        p->link=tmp;
        tmp->link=NULL;
        return start;
}/*End of addatend()*/

struct node *addafter(struct node *start,int data,int item)
{
        struct node *tmp,*p;
        p=start;
        while(p!=NULL)
        {
                if(p->info==item)
                {
                        tmp=(struct node *)malloc(sizeof(struct node));
                        tmp->info=data;
                        tmp->link=p->link;
                        p->link=tmp;
                        return start;
                }
                p=p->link;
        }
        printf("%d not present in the list\n",item);
        return start;
}/*End of addafter()*/

struct node *addbefore(struct node *start,int data,int item)
{
        struct node *tmp,*p;
        if(start==NULL )
        {
                printf("List is empty\n");
                return start;
        }
        /*If data to be inserted before first node*/
        if(item==start->info)
        {
                tmp=(struct node *)malloc(sizeof(struct node));
                tmp->info=data;
                tmp->link=start;
                start=tmp;
                return start;
        }
        p=start;
        while(p->link!=NULL)
        {
                if(p->link->info==item)
                {
                        tmp=(struct node *)malloc(sizeof(struct node));
                        tmp->info=data;
                        tmp->link=p->link;
                        p->link=tmp;
                        return start;
                }
                p=p->link;
        }
        printf("%d not present in the list\n",item);
        return start;
}/*End of addbefore()*/

struct node *addatpos(struct node *start,int data,int pos)
{
        struct node *tmp,*p;
        int i;
        tmp=(struct node *)malloc(sizeof(struct node));
        tmp->info=data;
        if(pos==1)
        {
                tmp->link=start;
                start=tmp;
                return start;
        }
        p=start;
        for(i=1; i<pos-1 && p!=NULL; i++)
                p=p->link;
        if(p==NULL)
                printf("There are less than %d elements\n",pos);
        else
        {
                tmp->link=p->link;
                p->link=tmp;
        }
        return start;
}/*End of addatpos()*/

struct node *del(struct node *start,int data)
{
        struct node *tmp,*p;
        if(start==NULL)
        {
                printf("List is empty\n");
                return start;
        }
        /*Deletion of first node*/
        if(start->info==data)
        {
                tmp=start;
                start=start->link;
                free(tmp);
                return start;
        }
        /*Deletion in between or at the end*/
        p=start;
        while(p->link!=NULL)
        {
                if(p->link->info==data)
                {
                        tmp=p->link;
                        p->link=tmp->link;
                        free(tmp);
                        return start;
                }
                p=p->link;
        }
        printf("Element %d not found\n",data);
        return start;
}/*End of del()*/

struct node *reverse(struct node *start)
{
        struct node *prev, *ptr, *next;
        prev=NULL;
        ptr=start;
        while(ptr!=NULL)
        {
                next=ptr->link;
                ptr->link=prev;
                prev=ptr;
                ptr=next;
        }
        start=prev;
        return start;
}/*End of reverse()*/

OUTPUT  : :


******************** OUTPUT **********************


1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 1
Enter the number of nodes : 5
Enter the element to be inserted : 1
Enter the element to be inserted : 2
Enter the element to be inserted : 3
Enter the element to be inserted : 4
Enter the element to be inserted : 5
1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 2
List is :
1 2 3 4 5

1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 3
Number of elements are 5
1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 4
Enter the element to be searched : 2
Item 2 found at position 2
1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 5
Enter the element to be inserted : 0
1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 2
List is :
0 1 2 3 4 5

1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 6
Enter the element to be inserted : 6
1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 2
List is :
0 1 2 3 4 5 6

1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 7
Enter the element to be inserted : 7
Enter the element after which to insert : 6
1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 2
List is :
0 1 2 3 4 5 6 7

1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 8
Enter the element to be inserted : -1
Enter the element before which to insert : 0
1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 2
List is :
-1 0 1 2 3 4 5 6 7

1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 9
Enter the element to be inserted : -2
Enter the position at which to insert : 1
1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 2
List is :
-2 -1 0 1 2 3 4 5 6 7

1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 10
Enter the element to be deleted : 7
1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 2
List is :
-2 -1 0 1 2 3 4 5 6

1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 11
1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 2
List is :
6 5 4 3 2 1 0 -1 -2

1.Create List
2.Display
3.Count
4.Search
5.Add to empty list / Add at beginning
6.Add at end
7.Add after node
8.Add before node
9.Add at position
10.Delete
11.Reverse
12.Quit

Enter your choice : 12

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….

4.5 2 votes
Article Rating
Subscribe
Notify of
guest
0 Comments
Inline Feedbacks
View all comments