Traverse Backward

Medium Doubly Linked List: Basics

Solve in Playground →

Problem Statement

Write a C program to build a doubly linked list and traverse it in reverse (backward) order starting from the tail.

Input Format

First line contains n. Second line contains n integers.

Output Format

Print the elements in reverse/backward order separated by spaces.

Constraints

1 <= n <= 100

Sample Input

4
1 2 3 4

Sample Output

4 3 2 1

Explanation

Traverse to the tail node using next pointers, then iterate backwards using prev pointers to print elements.

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) {
        // Write your code here to build list and traverse backward
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →