Delete by Value

Medium Doubly Linked List: Deletion

Solve in Playground →

Problem Statement

Write a C program to delete the first node matching a specific value from a doubly linked list.

Input Format

First line contains n. Second line contains n elements. Third line contains the value to delete.

Output Format

Print the updated doubly linked list separated by spaces.

Constraints

1 <= n <= 100

Sample Input

5
10 20 30 40 50
30

Sample Output

10 20 40 50

Explanation

Traverse to locate the node with the target value, adjust neighbor pointers, and free the node.

Starter Code

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

struct Node {
    int data;
    struct Node *next;
    struct Node *prev;
};

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        struct Node *head = NULL, *tail = NULL;
        for (int i = 0; i < n; i++) {
            int val;
            scanf("%d", &val);
            struct Node *newNode = (struct Node *)malloc(sizeof(struct Node));
            newNode->data = val;
            newNode->next = NULL;
            newNode->prev = tail;
            if (head == NULL) {
                head = newNode;
                tail = newNode;
            } else {
                tail->next = newNode;
                tail = newNode;
            }
        }
        int targetVal;
        scanf("%d", &targetVal);
        // Write your code here to delete by value
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →