Update Node Value

Medium Singly Linked List: Update

Solve in Playground →

Problem Statement

Write a C program to update the data value of a node at a specified 0-based position in a singly linked list.

Input Format

First line contains n. Second line contains n elements. Third line contains the 0-based index position. Fourth line contains the new value.

Output Format

Print the updated linked list separated by spaces.

Constraints

0 <= position < n <= 100

Sample Input

4
10 20 30 40
2
99

Sample Output

10 20 99 40

Explanation

Traverse to the specified node index and overwrite its data field with the new value.

Starter Code

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

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

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;
            if (head == NULL) {
                head = newNode;
                tail = newNode;
            } else {
                tail->next = newNode;
                tail = newNode;
            }
        }
        int pos, newVal;
        scanf("%d %d", &pos, &newVal);
        // Write your code here to update node value at position
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →