Scribd
Upload
124 views3 pages

Implentation of Linked List

This C program demonstrates how to insert nodes at different positions in a single linked list. It defines functions to insert nodes at the front, end, and any position by manipulating the link pointers. The main function initializes a header node and uses a menu to call the insertion functions. It allows the user to continue inserting nodes or display the list. The insertion functions allocate memory for new nodes, assign data values, and correctly link the nodes to insert them in the specified position.

Uploaded by

Anonymous gk95G2MIMN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
124 views3 pages

Implentation of Linked List

This C program demonstrates how to insert nodes at different positions in a single linked list. It defines functions to insert nodes at the front, end, and any position by manipulating the link pointers. The main function initializes a header node and uses a menu to call the insertion functions. It allows the user to continue inserting nodes or display the list. The insertion functions allocate memory for new nodes, assign data values, and correctly link the nodes to insert them in the specified position.

Uploaded by

Anonymous gk95G2MIMN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

C program to insert a node at front, at end,

and at any position in a Single Linked List.


#include<stdio.h>
#include<conio.h>
//Create a basic structure for NODE from which new nodes can be created.
struct node
{
int data;
struct node *link;
};
//Initialize 3 pointers as globals so that they do not need to be passed in
functions.
struct node *header, *ptr, *temp;
//Prototypes for various user defined functions.
void insert_front();
void insert_end();
void insert_any();
void display();
void main()
{
int choice;
int cont = 1;
//Allocate memory for header node.
header = (struct node *) malloc(sizeof(struct node));
clrscr();
//Set the content of header node
header->data = NULL;
header->link = NULL;
while(cont == 1)
{
//Display menu to the user
printf("\n1. Insert at front\n");
printf("\n2. Insert at end\n");
printf("\n3. Insert at any position\n");
printf("\n4. Display linked list\n");
printf("\nEnter your choice: ");
scanf("%d", &choice);
switch(choice)
{
case 1:

insert_front();
break;
case 2:
case 3:

insert_end();
break;
insert_any();
break;

case 4:
}

display();
break;

printf("\n\nDo you want to continue? (1 / 0): ");


scanf("%d", &cont);

getch();
}
//Function to insert a node at the front of a single linked list.
void insert_front()
{
int data_value;
printf("\nEnter data of the node: ");
scanf("%d", &data_value);
temp = (struct node *) malloc(sizeof(struct node));

temp->data = data_value;
temp->link = header->link;
header->link = temp;

//Function to insert a node at the end of a single linked list.


void insert_end()
{
int data_value;
printf("\nEnter data of the node: ");
scanf("%d", &data_value);
temp = (struct node *) malloc(sizeof(struct node));
//Traverse to the end of the linked list.
ptr = header;
while(ptr->link != NULL)
{
ptr = ptr->link;
}

temp->data = data_value;
temp->link = ptr->link;
ptr->link = temp;

//Function to insert a node at any position after a particular node.


void insert_any()
{
int data_value, key;
printf("\nEnter data of the node: ");
scanf("%d", &data_value);
printf("\nEnter data of the node after which new node is to be
inserted: ");
scanf("%d", &key);
temp = (struct node *) malloc(sizeof(struct node));

//Traverse till key is found or end of the linked list is reached.


ptr = header;
while(ptr->link != NULL && ptr->data != key)
{
ptr = ptr->link;
}
if(ptr->data == key)
{
temp->data = data_value;
temp->link = ptr->link;
ptr->link = temp;
}
else
{
printf("\nValue %d not found\n",key);
}

//Function to display the contents of the linked list.


void display()
{
printf("\nContents of the linked list are: \n");
//Print the contents of the linked list starting from header
ptr = header;
while(ptr->link != NULL)
{
ptr = ptr->link;
printf("%d ", ptr->data);
}
}

You might also like