Peek Rear

Easy Queue: Linked List Implementation

Solve in Playground →

Problem Statement

Write a C program to enqueue elements into a linked list queue and print the rear element using a peek operation.

Input Format

First line contains n. Second line contains n elements to enqueue.

Output Format

Print the rear element of the linked list queue.

Constraints

1 <= n <= 50

Sample Input

4
10 20 30 40

Sample Output

Explanation

Verify that rear is not NULL and print `rear->data` without modifying the queue.

Starter Code

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

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

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        // Write your code here to enqueue elements and peek rear of linked list queue
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →