C Program of the single linked list with header node

Views 49

About:

C Program of the single linked list with header node

Program:

/*C Program of the single linked list with header node*/

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

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

struct node *create_list(struct node *head);
void display(struct node *head);
struct node *addatend(struct node *head,int data);
struct node *addbefore(struct node *head,int data,int item );
struct node *addatpos(struct node *head,int data,int pos);
struct node *del(struct node *head,int data);
struct node *reverse(struct node *head);

main()
{
	int choice,data,item,pos;
	struct node *head;	
	head=(struct node *)malloc(sizeof(struct node));
	head->info=0;	
	head->link=NULL;
	
	head=create_list(head);
	
	while(1)
	{
		
		printf("1.Display\n");
		printf("2.Add at end\n");
		printf("3.Add before node\n");
		printf("4.Add at position\n");
		printf("5.Delete\n");
		printf("6.Reverse\n");
		printf("7.Quit\n\n");
		printf("Enter your choice : ");
		scanf("%d",&choice);
		switch(choice)
		{
		 case 1:
			display(head);
			break;
		 case 2:
			printf("Enter the element to be inserted : ");
			scanf("%d",&data);
			head=addatend(head,data);
			break;
		 case 3:
			printf("Enter the element to be inserted : ");
			scanf("%d",&data);
			printf("Enter the element before which to insert : ");
			scanf("%d",&item);
			head=addbefore(head,data,item);
			break;
		 case 4:
			printf("Enter the element to be inserted : ");
			scanf("%d",&data);
			printf("Enter the position at which to insert : ");
			scanf("%d",&pos);
			head=addatpos(head,data,pos);
			break;
		 case 5:
			printf("Enter the element to be deleted : ");
			scanf("%d",&data);
			head=del(head,data);	
			break;
		 case 6:
			head=reverse(head);
			break;
		 case 7:
			 exit(1);
		 default:
			printf("Wrong choice\n\n");
		}/*End of switch */
	}/*End of while */
}/*End of main()*/

struct node *create_list(struct node *head)
{
	int i,n,data;
	printf("Enter the number of nodes : ");
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		printf("Enter the element to be inserted : ");
		scanf("%d",&data);
		head=addatend(head,data);	
	}
	return head;
}/*End of create_list()*/

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

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

struct node *addbefore(struct node *head,int data,int item)
{
	struct node *tmp,*p;
	p=head;
	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 head;
		}
		p=p->link;
	}
	printf("%d not present in the list\n",item);
	return head;
}/*End of addbefore()*/		

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

struct node *del(struct node *head, int data)
{
	struct node *tmp,*p;
	p=head;
	while(p->link!=NULL)
	{
		if(p->link->info==data)   
		{
			tmp=p->link;
			p->link=tmp->link;
			free(tmp);
			return head;
		}
		p=p->link;
	}
	printf("Element %d not found\n",data);
	return head;
}/*End of del()*/

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

Output:

Output :

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.Display 2.Add at end 3.Add before node 4.Add at position 5.Delete 6.Reverse 7.Quit Enter your choice : 2 Enter the element to be inserted : 12 1.Display 2.Add at end 3.Add before node 4.Add at position 5.Delete 6.Reverse 7.Quit Enter your choice : 2 Enter the element to be inserted : 14 1.Display 2.Add at end 3.Add before node 4.Add at position 5.Delete 6.Reverse 7.Quit Enter your choice : 1 List is : 1 2 3 4 5 12 14 1.Display 2.Add at end 3.Add before node 4.Add at position 5.Delete 6.Reverse 7.Quit Enter your choice : 6 1.Display 2.Add at end 3.Add before node 4.Add at position 5.Delete 6.Reverse 7.Quit Enter your choice : 1 List is : 14 12 5 4 3 2 1 1.Display 2.Add at end 3.Add before node 4.Add at positio

Explanation:

C Program of the single linked list with header node

Share Me:

Program List

Data Structure Program List
1.  Implementation of Quicksort Algorithm using C 2.  Tree Traversal in C Programming Language 3.  C Program of polynomial addition and multiplication using linked list 4.  C Program to concatenate two circular linked lists 5.  C Program to concatenate two single linked lists 6.  C Program of sorting a singly linked list 7.  Program of merging two sorted single linked lists 8.  C Program of sorted linked list 9.  C Program of the single linked list with header node 10.  C Program of circular linked list 11.  C Program of doubly linked list 12.  C Program of single linked list 13.  C Program of the queue using the circular linked list 14.  C Program of the circular queue 15.  C Program of dequeue using a circular array 16.  C Program of reversing a string using stack 17.  C Program of priority queue using a linked list 18.  Program of queue using linked list 19.  Program of queue using array 20.  Program of stack using linked list 21.  Program of stack using array 22.  Array limit value and an array element address are printed in this program 23.  Implementation of insertion sort in c programming language 24.  C Program to Read Array Elements 25.  C Program to Print Array Elements 26.  How to add array Elements with a constant 27.  Multiply all elements in an array 28.  How to add only the even elements in the array 29.  How to add only the odd elements in the array 30.  How to add an element to every element of the array 31.  How to subtract an element form every element of the array 32.  How to multiply an element to every element of the array 33.  How to divide an element from every element of the array 34.  How to square each element of the array 35.  Add all element in the array 36.  C Program to Delete an element from the specified location from Array 37.  C Program to Insert an element in an Array 38.  C Program to Copy all elements of an array into Another array 39.  C Program to Search an element in Array 40.  C Program to Merge Two arrays in C Programming 41.  C Program to Reversing an Array Elements in C Programming 42.  C Program to Find Largest Element in Array in C Programming 43.  C Program to Find Smallest Element in Array in C Programming 44.  C Program to Calculate Addition of All Elements in Array 45.  C Program to Delete duplicate elements from an array 46.  C Program to Read integers into an array and Reversing them using Pointers 47.  Bubble sort algorithm implementation in C 48.  Bubble sort in C language using function 49.  C program for implementation of selection sort input taken inside program 50.  Selection sort algorithm implementation in C 51.  C Program to Sort Elements Using Selection Sort Algorithm 52.  Selection Sort Program in C using different function 53.  Merge Sort program in the data structure 54.  Implementing QuickSort Algorithm