Why Doubly Linked List Over Singly Linked List in DSA C++ - Quick Recap

Recall & Review

beginner

What is a doubly linked list?

A doubly linked list is a type of linked list where each node has two pointers: one to the next node and one to the previous node. This allows traversal in both directions.

beginner

What is the main limitation of a singly linked list compared to a doubly linked list?

A singly linked list can only be traversed in one direction (forward), while a doubly linked list can be traversed both forward and backward.

intermediate

Why might a doubly linked list be preferred for deletion of a node?

In a doubly linked list, deletion is easier because you can access the previous node directly, so you don't need to traverse from the head to find it as in a singly linked list.

intermediate

What is a trade-off when using a doubly linked list instead of a singly linked list?

A doubly linked list uses more memory because each node stores an extra pointer to the previous node, but it offers more flexible traversal and easier deletion.

beginner

How does a doubly linked list improve traversal compared to a singly linked list?

It allows moving both forward and backward through the list, making operations like reverse traversal and bidirectional iteration simpler and faster.

Which pointer does a node in a doubly linked list have that a singly linked list node does not?

A Pointer to the tail node

B Pointer to the next node

C Pointer to the head node

D Pointer to the previous node

A doubly linked list node has a pointer to the previous node, which a singly linked list node does not have.

What is a key advantage of a doubly linked list when deleting a node?

A No need to traverse from the head to find the previous node

B Uses less memory

C Can only delete from the end

D Deletion is not possible

Because each node has a pointer to the previous node, deletion can be done directly without traversing from the head.

What is a disadvantage of using a doubly linked list over a singly linked list?

A No advantage in deletion

B Cannot traverse backwards

C More memory usage per node

D Slower insertion at the head

Doubly linked lists use more memory because each node stores an extra pointer to the previous node.

Which operation is easier in a doubly linked list compared to a singly linked list?

A Only forward traversal

B Reverse traversal

C Accessing the head node

D Accessing the tail node

Doubly linked lists allow reverse traversal easily because nodes have pointers to previous nodes.

In which scenario is a doubly linked list especially useful?

A When you need to traverse both forward and backward

B When memory is very limited

C When only forward traversal is needed

D When nodes have no pointers

Doubly linked lists are useful when bidirectional traversal is required.

Explain why a doubly linked list might be chosen over a singly linked list for certain applications.

Think about how nodes connect and how that affects operations.

Describe the main differences in node structure between singly and doubly linked lists and how these differences impact their usage.

Focus on pointers and their effects on list operations.

Practice

1. Why is a doubly linked list preferred over a singly linked list when you need to traverse the list backwards?

easy

A. Because doubly linked lists use less memory than singly linked lists.

B. Because singly linked lists have pointers to previous nodes only.

C. Because doubly linked lists have pointers to both next and previous nodes, allowing backward traversal.

D. Because singly linked lists can only store integer data.

Solution

1. Step 1: Understand pointer directions in linked lists

   Singly linked lists have pointers only to the next node, so you cannot move backwards easily. Doubly linked lists have pointers to both next and previous nodes.

2. Step 2: Identify traversal capability

   Because doubly linked lists have previous pointers, they allow traversal in both directions, including backwards.

3. Final Answer:

   Because doubly linked lists have pointers to both next and previous nodes, allowing backward traversal. -> Option C

4. Quick Check:

   Backward traversal needs previous pointers = A [OK]

Hint: Backward traversal needs previous pointers in nodes [OK]

Common Mistakes:

• Thinking singly linked lists have previous pointers
• Confusing memory usage with traversal ability
• Assuming singly linked lists can traverse backwards

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; Node* prev; Node* next; };

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

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

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

Solution

1. Step 1: Identify required pointers for doubly linked list node

   A doubly linked list node must have pointers to both the previous and next nodes.

2. Step 2: Match the structure declaration

   struct Node { int data; Node* prev; Node* next; }; declares both Node* prev and Node* next, which is correct. Others miss one pointer or have duplicate pointers.

3. Final Answer:

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

4. Quick Check:

   Doubly linked list node needs prev and next pointers = C [OK]

Hint: Doubly linked list nodes have prev and next pointers [OK]

Common Mistakes:

• Missing prev pointer in node structure
• Duplicating next pointer instead of prev
• Confusing singly linked list node with doubly linked list node

3. You need to implement a feature that allows moving both forward and backward through a list of songs in a music player. Why is a doubly linked list a better choice than a singly linked list for this feature?

easy

A. Because singly linked lists use less memory and are faster for this feature.

B. Because singly linked lists automatically reverse the list when needed.

C. Because doubly linked lists can store song metadata directly in nodes.

D. Because doubly linked lists allow efficient backward and forward traversal.

Solution

1. Step 1: Understand traversal needs in music player

   The feature requires moving forward and backward through songs, so traversal in both directions is needed.

2. Step 2: Compare singly and doubly linked lists for traversal

   Singly linked lists only allow forward traversal easily, while doubly linked lists have pointers to previous nodes, enabling backward traversal efficiently.

3. Final Answer:

   Because doubly linked lists allow efficient backward and forward traversal. -> Option D

4. Quick Check:

   Bidirectional traversal needs doubly linked list = B [OK]

Hint: Bidirectional traversal needs doubly linked list [OK]

Common Mistakes:

• Assuming singly linked lists can traverse backward easily
• Confusing memory usage with traversal capability
• Thinking doubly linked lists store metadata differently

4. Consider the following C++ code snippet for a doubly linked list insertion at the end. What will be the output after inserting nodes with values 10 and 20?

medium

A. 10 <-> 20 <-> null

B. 20 <-> 10 <-> null

C. 10 -> 20 -> null

D. null <- 10 <- 20

Solution

1. Step 1: Understand insertion at end in doubly linked list

   Inserting 10 first creates a node with data 10. Inserting 20 next adds it after 10, linking 10's next to 20 and 20's prev to 10.

2. Step 2: Visualize the list after insertions

   The list looks like: 10 <-> 20 <-> null, showing bidirectional links and null at the end.

3. Final Answer:

   10 <-> 20 <-> null -> Option A

4. Quick Check:

   Insertion at end keeps order 10 then 20 = D [OK]

Hint: Insertion at end appends nodes in order [OK]

Common Mistakes:

• Reversing node order after insertion
• Using singly linked list arrow notation
• Ignoring prev pointer links

5. The following code attempts to delete a node from a doubly linked list but causes a runtime error. What is the main issue?

void deleteNode(Node* del) {
  if (del == nullptr) return;
  if (del->prev != nullptr) del->prev->next = del->next;
  if (del->next != nullptr) del->next->prev = del->prev;
  delete del;
}

medium

A. It deletes the node before updating pointers.

B. It does not update the head pointer if the deleted node is the head.

C. It does not check if del is the tail node.

D. It uses incorrect pointer syntax.

Solution

1. Step 1: Analyze pointer updates in deletion

   The code updates previous and next nodes' pointers correctly but does not handle the case when the node to delete is the head (no prev).

2. Step 2: Identify missing head update

   If the node is head, the external head pointer must be updated to del->next, which is missing, causing dangling head pointer and runtime errors.

3. Final Answer:

   It does not update the head pointer if the deleted node is the head. -> Option B

4. Quick Check:

   Head node deletion needs head pointer update = A [OK]

Hint: Always update head if deleting the first node [OK]

Common Mistakes:

• Deleting node before fixing pointers
• Ignoring head pointer update
• Confusing tail node handling with head node