Practice Challenge

Hard Doubly Linked List: Advanced PRO

🔒 Login to Unlock

Problem Statement

Write a C program to flatten a multi-level doubly linked list where nodes might have a child doubly linked list pointer, printing the flattened list in forward order.

Input Format

Input format matching standard multi-level serialization or structured node sequence.

Output Format

Print the flattened doubly linked list separated by spaces.

Constraints

1 <= n <= 50

Sample Input

5
1 2 3 4 5

Sample Output

1 2 3 4 5

Explanation

Traverse the doubly linked list, and whenever a child list is encountered, splice it between the current node and its next node.

Starter Code

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

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

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        // Write your code here for doubly linked list practice challenge
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock