C Exercises: Delete node from any position of a doubly linked list
C Doubly Linked List : Exercise-9 with Solution
Write a program in C to delete a node from any position in a doubly linked list.
Pictorial Presentation:

Sample Solution:
C Code:
#include <stdio.h>
#include <stdlib.h>
struct node {
int num;
struct node * preptr;
struct node * nextptr;
}*stnode, *ennode;
void DlListcreation(int n);
void DlListDeleteFirstNode();
void DlListDeleteLastNode();
void DlListDeleteAnyNode(int pos);
void displayDlList(int a);
int main()
{
int n,num1,a,insPlc;
stnode = NULL;
ennode = NULL;
printf("\n\n Doubly Linked List : Delete node from any position of a doubly linked list :\n");
printf("----------------------------------------------------------------------------------\n");
printf(" Input the number of nodes (3 or more ): ");
scanf("%d", &n);
DlListcreation(n);
a=1;
displayDlList(a);
printf(" Input the position ( 1 to %d ) to delete a node : ",n);
scanf("%d", &insPlc);
if(insPlc<1 || insPlc>n)
{
printf("\n Invalid position. Try again.\n ");
}
if(insPlc>=1 && insPlc<=n)
{
DlListDeleteAnyNode(insPlc);
a=2;
displayDlList(a);
}
return 0;
}
void DlListcreation(int n)
{
int i, num;
struct node *fnNode;
if(n >= 1)
{
stnode = (struct node *)malloc(sizeof(struct node));
if(stnode != NULL)
{
printf(" Input data for node 1 : "); // assigning data in the first node
scanf("%d", &num);
stnode->num = num;
stnode->preptr = NULL;
stnode->nextptr = NULL;
ennode = stnode;
for(i=2; i<=n; i++)
{
fnNode = (struct node *)malloc(sizeof(struct node));
if(fnNode != NULL)
{
printf(" Input data for node %d : ", i);
scanf("%d", &num);
fnNode->num = num;
fnNode->preptr = ennode; // new node is linking with the previous node
fnNode->nextptr = NULL; // set next address of fnnode is NULL
ennode->nextptr = fnNode; // previous node is linking with the new node
ennode = fnNode; // assign new node as last node
}
else
{
printf(" Memory can not be allocated.");
break;
}
}
}
else
{
printf(" Memory can not be allocated.");
}
}
}
void DlListDeleteAnyNode(int pos)
{
struct node *curNode;
int i;
curNode = stnode;
for(i=1; i<pos && curNode!=NULL; i++)
{
curNode = curNode->nextptr;
}
if(pos == 1)
{
DlListDeleteFirstNode();
}
else if(curNode == ennode)
{
DlListDeleteLastNode();
}
else if(curNode != NULL)
{
curNode->preptr->nextptr = curNode->nextptr;
curNode->nextptr->preptr = curNode->preptr;
free(curNode); //Delete the n node
}
else
{
printf(" The given position is invalid!\n");
}
}
void DlListDeleteFirstNode()
{
struct node * NodeToDel;
if(stnode == NULL)
{
printf(" Delete is not possible. No data in the list.\n");
}
else
{
NodeToDel = stnode;
stnode = stnode->nextptr; // move the next address of starting node to 2 node
stnode->preptr = NULL; // set previous address of staring node is NULL
free(NodeToDel); // delete the first node from memory
}
}
void DlListDeleteLastNode()
{
struct node * NodeToDel;
if(ennode == NULL)
{
printf(" Delete is not possible. No data in the list.\n");
}
else
{
NodeToDel = ennode;
ennode = ennode->preptr; // move the previous address of the last node to 2nd last node
ennode->nextptr = NULL; // set the next address of last node to NULL
free(NodeToDel); // delete the last node
}
}
void displayDlList(int m)
{
struct node * tmp;
int n = 1;
if(stnode == NULL)
{
printf(" No data found in the List yet.");
}
else
{
tmp = stnode;
if (m==1)
{
printf("\n Data entered in the list are :\n");
}
else
{
printf("\n After deletion the new list are :\n");
}
while(tmp != NULL)
{
printf(" node %d : %d\n", n, tmp->num);
n++;
tmp = tmp->nextptr; // current pointer moves to the next node
}
}
}
Sample Output:
Doubly Linked List : Delete node from any position of a doubly linked list : ---------------------------------------------------------------------------------- Input the number of nodes (3 or more ): 3 Input data for node 1 : 1 Input data for node 2 : 2 Input data for node 3 : 3 Data entered in the list are : node 1 : 1 node 2 : 2 node 3 : 3 Input the position ( 1 to 3 ) to delete a node : 3 After deletion the new list are : node 1 : 1 node 2 : 2
Flowchart:

DlListcreation() :

DlListDeleteAnyNode() :

DlListDeleteFirstNode() :

DlListDeleteLastNode() :

displayDlList() :

C Programming Code Editor:
Previous: Write a program in C to delete a node from the last of a doubly linked list.
Next: Write a program in C to delete a node from middle of a doubly linked list.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
- Weekly Trends
- Python Interview Questions and Answers: Comprehensive Guide
- Scala Exercises, Practice, Solution
- Kotlin Exercises practice with solution
- MongoDB Exercises, Practice, Solution
- SQL Exercises, Practice, Solution - JOINS
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join