Why Create and Initialize Doubly Linked List in DSA C?

The Big Idea

What if you could flip through your favorite songs forward and backward without losing track or getting confused?

The Scenario

Imagine you want to keep a list of your favorite songs in order, and you want to be able to go forward and backward through the list easily.

If you try to write down the list on paper and jump back and forth manually, it gets confusing and slow.

The Problem

Writing down the list manually means you have to remember where you are, and going backward means flipping pages or searching again.

This is slow and easy to make mistakes, like losing your place or mixing up the order.

The Solution

A doubly linked list is like having a special notebook where each song has a note pointing to the next and previous songs.

This way, you can move forward or backward easily without losing your place.

Before vs After

✗ Before

char* songs[3];
songs[0] = "Song A";
songs[1] = "Song B";
songs[2] = "Song C";

✓ After

struct Node {
  char* song;
  struct Node* next;
  struct Node* prev;
};
struct Node* head = NULL;

What It Enables

It lets you move forward and backward through your list quickly and safely, like flipping pages in a well-organized notebook.

Real Life Example

Music players use doubly linked lists to let you skip to the next or previous song smoothly without restarting the whole playlist.

Key Takeaways

Manual lists are slow and error-prone for back-and-forth navigation.

Doubly linked lists keep track of both next and previous items.

This makes moving forward and backward easy and reliable.

Practice

1. What is the main purpose of a doubly linked list in data structures?

easy

A. To allow traversal in both forward and backward directions

B. To store data in a fixed-size array

C. To sort data automatically

D. To store data only in one direction

Solution

1. Step 1: Understand doubly linked list structure

   A doubly linked list has nodes with pointers to both next and previous nodes.

2. Step 2: Identify traversal capability

   This structure allows moving forward and backward through the list easily.

3. Final Answer:

   To allow traversal in both forward and backward directions -> Option A

4. Quick Check:

   Doubly linked list = bidirectional traversal [OK]

Hint: Remember: doubly means two directions [OK]

Common Mistakes:

• Confusing doubly linked list with singly linked list
• Thinking it sorts data automatically
• Assuming it uses arrays internally

2. Which of the following is the correct way to declare a node structure for a doubly linked list in C?

easy

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

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

C. struct Node { int data; int next; int prev; };

D. struct Node { int data; struct Node next; struct Node prev; };

Solution

1. Step 1: Check node structure for doubly linked list

   Each node must have data, a pointer to next node, and a pointer to previous node.

2. Step 2: Identify correct syntax

   struct Node { int data; struct Node* prev; struct Node* next; }; correctly declares pointers to next and prev nodes using struct Node*.

3. Final Answer:

   struct Node { int data; struct Node* prev; struct Node* next; }; -> Option B

4. Quick Check:

   Node has data + prev pointer + next pointer [OK]

Hint: Pointers to prev and next must be struct Node* [OK]

Common Mistakes:

• Using int instead of pointer for next/prev
• Missing prev pointer in node
• Declaring next/prev as struct Node instead of pointer

3. What will be the output of the following C code snippet that creates a doubly linked list with two nodes and prints their data?

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

int main() {
  Node* head = (Node*)malloc(sizeof(Node));
  Node* second = (Node*)malloc(sizeof(Node));

  head->data = 10;
  head->prev = NULL;
  head->next = second;

  second->data = 20;
  second->prev = head;
  second->next = NULL;

  printf("%d -> %d -> NULL", head->data, second->data);
  return 0;
}

medium

A. Compilation error

B. 20 -> 10 -> NULL

C. 10 -> 20 -> NULL

D. 10 -> NULL

Solution

1. Step 1: Analyze node creation and linking

   Two nodes are created: head with data 10, second with data 20. head->next points to second, second->prev points to head.

2. Step 2: Understand print statement

   Prints head->data (10), then second->data (20), then "-> NULL".

3. Final Answer:

   10 -> 20 -> NULL -> Option C

4. Quick Check:

   Prints data in order: 10 then 20 [OK]

Hint: Follow pointers to print nodes in order [OK]

Common Mistakes:

• Confusing order of nodes
• Forgetting to set next or prev pointers
• Assuming print shows backward traversal

4. Identify the error in the following code snippet that attempts to initialize a doubly linked list node:

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

int main() {
  struct Node* node = malloc(sizeof(struct Node));
  node->data = 5;
  node->prev = NULL;
  node->next = NULL;
  free(node);
  printf("%d", node->data);
  return 0;
}

medium

A. Accessing freed memory after free(node)

B. Missing #include

C. Incorrect struct declaration

D. No error, code runs fine

Solution

1. Step 1: Review memory allocation and freeing

   Memory is allocated for node, initialized, then freed with free(node).

2. Step 2: Identify invalid access

   After freeing, code tries to print node->data, which accesses freed memory causing undefined behavior.

3. Final Answer:

   Accessing freed memory after free(node) -> Option A

4. Quick Check:

   Using pointer after free = error [OK]

Hint: Never use pointer after free() [OK]

Common Mistakes:

• Ignoring use-after-free errors
• Forgetting to include stdlib.h (but not main error here)
• Assuming free deletes pointer variable

5. You want to create a doubly linked list with nodes containing values 1, 2, and 3 in that order. Which code snippet correctly initializes this list with proper prev and next pointers?

hard

A. Node* n1 = malloc(sizeof(Node)); n1->data=1; n1->prev=NULL; n1->next=NULL;
Node* n2 = malloc(sizeof(Node)); n2->data=2; n2->prev=NULL; n2->next=NULL;
n1->next=n2;
Node* n3 = malloc(sizeof(Node)); n3->data=3; n3->prev=NULL; n3->next=NULL;
n2->next=n3;

B. Node* n1 = malloc(sizeof(Node)); n1->data=1; n1->prev=NULL; n1->next=NULL;
Node* n2 = malloc(sizeof(Node)); n2->data=2; n2->prev=n1; n2->next=NULL;
n1->next=n2;
Node* n3 = malloc(sizeof(Node)); n3->data=3; n3->prev=n2; n3->next=n1;
n2->next=n3;

C. Node* n1 = malloc(sizeof(Node)); n1->data=1; n1->prev=NULL; n1->next=NULL;
Node* n2 = malloc(sizeof(Node)); n2->data=2; n2->prev=n1; n2->next=NULL;
n1->next=n2;
Node* n3 = malloc(sizeof(Node)); n3->data=3; n3->prev=NULL; n3->next=NULL;
n2->next=n3;

D. Node* n1 = malloc(sizeof(Node)); n1->data=1; n1->prev=NULL; n1->next=NULL;
Node* n2 = malloc(sizeof(Node)); n2->data=2; n2->prev=n1; n2->next=NULL;
n1->next=n2;
Node* n3 = malloc(sizeof(Node)); n3->data=3; n3->prev=n2; n3->next=NULL;
n2->next=n3;

Solution

1. Step 1: Check initialization of first node

   n1 has data=1, prev=NULL, next=NULL initially.

2. Step 2: Link second node correctly

   n2 has data=2, prev=n1, next=NULL; n1->next points to n2.

3. Step 3: Link third node correctly

   n3 has data=3, prev=n2, next=NULL; n2->next points to n3.

4. Final Answer:

   Code snippet B correctly sets prev and next pointers for all nodes -> Option D

5. Quick Check:

   Each node's prev and next link neighbors properly [OK]

Hint: Prev of first is NULL; next of last is NULL [OK]

Common Mistakes:

• Not setting prev pointers for nodes after first
• Setting next pointers incorrectly
• Making circular links unintentionally