Why Insert at End of Doubly Linked List in DSA C?

The Big Idea

What if you could add items to the end of a list instantly, no matter how long it is?

The Scenario

Imagine you have a long chain of paper clips linked together. You want to add a new paper clip at the very end of the chain. Doing this by hand means you have to find the last clip first, which can take a lot of time if the chain is very long.

The Problem

Manually finding the end of the chain each time you want to add a new clip is slow and tiring. You might lose track of the last clip or accidentally break the chain. This makes adding new clips frustrating and error-prone.

The Solution

Using a doubly linked list lets you easily add a new element at the end by keeping track of the last node. You don't have to start from the beginning every time. This saves time and reduces mistakes, making your chain grow smoothly.

Before vs After

✗ Before

struct Node {
    int data;
    struct Node* next;
};
// To add at end, traverse from head to last node every time

✓ After

struct Node {
    int data;
    struct Node* next;
    struct Node* prev;
};
// Keep track of tail pointer to add at end directly

What It Enables

This lets you quickly and safely add new items at the end of a list, even when it grows very large.

Real Life Example

Think of a music playlist where you add new songs at the end. Using a doubly linked list helps the app add songs instantly without searching through the whole list.

Key Takeaways

Manually adding at the end is slow and error-prone.

Doubly linked lists keep track of the end for quick insertion.

This makes adding at the end fast and reliable.

Practice

1. What is the main purpose of inserting a node at the end of a doubly linked list?

easy

A. To add a new element after the last node

B. To remove the first node

C. To reverse the list

D. To find the middle node

Solution

1. Step 1: Understand the list structure

   A doubly linked list has nodes connected forward and backward, allowing traversal in both directions.

2. Step 2: Purpose of insertion at end

   Inserting at the end means adding a new node after the last node, extending the list.

3. Final Answer:

   To add a new element after the last node -> Option A

4. Quick Check:

   Insert at end = add after last node [OK]

Hint: Insert at end means add after last node [OK]

Common Mistakes:

• Confusing insertion at end with deletion
• Thinking insertion happens at the start
• Mixing up singly and doubly linked list operations

2. Which of the following is the correct way to update the 'next' pointer of the last node when inserting a new node at the end in C?

easy

A. last->next = newNode;

B. newNode->next = last;

C. last->prev = newNode;

D. newNode->prev = NULL;

Solution

1. Step 1: Identify the last node's next pointer

   The last node's 'next' pointer should point to the new node to link it at the end.

2. Step 2: Correct pointer assignment

   Assigning 'last->next = newNode;' correctly links the new node after the last node.

3. Final Answer:

   last->next = newNode; -> Option A

4. Quick Check:

   Last node's next points to new node [OK]

Hint: Last node's next points to new node [OK]

Common Mistakes:

• Assigning newNode->next to last (wrong direction)
• Changing last->prev instead of last->next
• Setting newNode->prev to NULL instead of last

3. What will be the output of the following code snippet after inserting a node with value 5 at the end of the doubly linked list 1 <-> 3 <-> 4?

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

void insertEnd(struct Node** head, int val) {
  struct Node* newNode = malloc(sizeof(struct Node));
  newNode->data = val;
  newNode->next = NULL;
  if (*head == NULL) {
    newNode->prev = NULL;
    *head = newNode;
    return;
  }
  struct Node* temp = *head;
  while (temp->next != NULL) {
    temp = temp->next;
  }
  temp->next = newNode;
  newNode->prev = temp;
}

void printList(struct Node* head) {
  while (head != NULL) {
    printf("%d ", head->data);
    head = head->next;
  }
}

int main() {
  struct Node* head = malloc(sizeof(struct Node));
  head->data = 1; head->prev = NULL;
  struct Node* second = malloc(sizeof(struct Node));
  second->data = 3; second->prev = head; head->next = second;
  struct Node* third = malloc(sizeof(struct Node));
  third->data = 4; third->prev = second; second->next = third; third->next = NULL;
  insertEnd(&head, 5);
  printList(head);
  return 0;
}

medium

A. 1 3 4 0

B. 1 3 4 5

C. 1 3 4

D. 5 1 3 4

Solution

1. Step 1: Understand initial list and insertion

   The list is 1 <-> 3 <-> 4. The function inserts 5 at the end by traversing to last node (4) and linking new node after it.

2. Step 2: Trace printList output

   After insertion, list is 1 <-> 3 <-> 4 <-> 5. Printing nodes in order outputs "1 3 4 5 "

3. Final Answer:

   1 3 4 5 -> Option B

4. Quick Check:

   List after insertEnd = 1 3 4 5 [OK]

Hint: Traverse to last, link new node, print all nodes [OK]

Common Mistakes:

• Not setting newNode->prev correctly
• Forgetting to set last node's next to newNode
• Printing before insertion

4. Identify the error in the following code snippet for inserting a node at the end of a doubly linked list:

void insertEnd(struct Node** head, int val) {
  struct Node* newNode = malloc(sizeof(struct Node));
  newNode->data = val;
  newNode->next = NULL;
  if (*head == NULL) {
    *head = newNode;
    return;
  }
  struct Node* temp = *head;
  while (temp->next != NULL) {
    temp = temp->next;
  }
  temp->next = newNode;
}

medium

A. Wrong condition in while loop

B. Incorrect malloc size

C. Missing setting newNode->prev pointer

D. Not updating head pointer

Solution

1. Step 1: Check pointer assignments for doubly linked list

   In doubly linked list, newNode->prev must point to the last node (temp) after insertion.

2. Step 2: Identify missing pointer update

   The code sets temp->next = newNode but does not set newNode->prev = temp, breaking backward link.

3. Final Answer:

   Missing setting newNode->prev pointer -> Option C

4. Quick Check:

   newNode->prev must be set [OK]

Hint: Always set newNode->prev to last node [OK]

Common Mistakes:

• Forgetting newNode->prev assignment
• Assuming singly linked list logic applies
• Not handling empty list case

5. Given a doubly linked list with nodes 10 <-> 20 <-> 30, write the sequence of pointer changes when inserting a new node with value 40 at the end. Which of the following correctly describes the final connections?

hard

A. newNode->prev = NULL; newNode->next = NULL; last->next = NULL

B. newNode->next = last; last->prev = newNode; newNode->prev = NULL

C. last->prev = newNode; newNode->next = last; newNode->prev = NULL

D. last->next = newNode; newNode->prev = last; newNode->next = NULL

Solution

1. Step 1: Identify last node and new node pointers

   Last node is 30. New node 40 should be linked after 30 with next NULL.

2. Step 2: Correct pointer assignments

   Set last->next = newNode to link forward, newNode->prev = last for backward link, and newNode->next = NULL as it is new end.

3. Final Answer:

   last->next = newNode; newNode->prev = last; newNode->next = NULL -> Option D

4. Quick Check:

   New node linked after last with proper prev and next [OK]

Hint: New node's prev = last; last's next = new node; new node's next = NULL [OK]

Common Mistakes:

• Reversing prev and next pointers
• Setting newNode->prev to NULL incorrectly
• Not setting last->next to newNode