Why Delete Node at End in DSA C++?

The Big Idea

What if removing the last item from your list could be as easy as snapping your fingers?

The Scenario

Imagine you have a long paper chain made of connected rings. You want to remove the last ring, but you only have scissors that can cut one ring at a time, and you must find the second last ring first to safely remove the last one.

The Problem

Manually finding the second last ring by counting or guessing is slow and can cause mistakes like cutting the wrong ring or breaking the chain. It becomes frustrating as the chain grows longer.

The Solution

Using the "Delete Node at End" method in a linked list helps you quickly find and remove the last node by following the chain just once, making the process safe, fast, and error-free.

Before vs After

✗ Before

Node* temp = head;
while(temp->next->next != nullptr) {
    temp = temp->next;
}
delete temp->next;
temp->next = nullptr;

✓ After

if(head == nullptr) return;
if(head->next == nullptr) {
    delete head;
    head = nullptr;
    return;
}
Node* temp = head;
while(temp->next->next != nullptr) {
    temp = temp->next;
}
delete temp->next;
temp->next = nullptr;

What It Enables

This method enables efficient and safe removal of the last element in a linked list, keeping your data structure clean and up-to-date.

Real Life Example

Think of a music playlist where you want to remove the last song you added. Using this method, you can quickly delete the last song without disturbing the rest of the playlist.

Key Takeaways

Manual removal of the last node is slow and error-prone.

Deleting the last node properly requires finding the second last node.

Using this method makes removal safe, fast, and reliable.

Practice

1. What happens when you delete the last node in a singly linked list?

easy

A. The second last node's next pointer becomes null

B. The head pointer is set to null

C. The first node is deleted instead

D. All nodes are deleted

Solution

1. Step 1: Understand the linked list structure

   Each node points to the next node. The last node points to null.

2. Step 2: Effect of deleting the last node

   Deleting the last node means the previous node's next pointer must be set to null to mark new end.

3. Final Answer:

   The second last node's next pointer becomes null -> Option A

4. Quick Check:

   Last node removed, previous node points to null [OK]

Hint: Last node removal sets previous node's next to null [OK]

Common Mistakes:

• Setting head to null incorrectly
• Deleting the first node instead
• Not updating the previous node's next pointer

2. Which of the following is the correct syntax to delete the last node in a singly linked list in C++?

easy

A. delete lastNode->prev; lastNode->prev = nullptr;

B. delete lastNode; lastNode = nullptr;

C. delete head; head = nullptr;

D. delete lastNode->next; lastNode->next = nullptr;

Solution

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

   In singly linked list, last node's previous node points to it via next pointer.

2. Step 2: Delete last node and update pointer

   Deleting lastNode->next and setting lastNode->next to nullptr correctly removes last node.

3. Final Answer:

   delete lastNode->next; lastNode->next = nullptr; -> Option D

4. Quick Check:

   Delete next node and set pointer null [OK]

Hint: Delete node via previous node's next pointer [OK]

Common Mistakes:

• Deleting head instead of last node
• Using prev pointer in singly linked list
• Not setting pointer to nullptr after delete

3. What will be the output linked list after deleting the last node from the list: 10 -> 20 -> 30 -> 40 -> null?

medium

A. 10 -> 20 -> null

B. 10 -> 20 -> 30 -> null

C. 20 -> 30 -> 40 -> null

D. 10 -> 20 -> 30 -> 40 -> null

Solution

1. Step 1: Identify the last node

   The last node is 40, which points to null.

2. Step 2: Remove last node and update previous node

   Deleting 40 means 30's next pointer becomes null, ending list at 30.

3. Final Answer:

   10 -> 20 -> 30 -> null -> Option B

4. Quick Check:

   Last node 40 removed, list ends at 30 [OK]

Hint: Last node removed, previous node points to null [OK]

Common Mistakes:

• Not updating previous node's next pointer
• Deleting head node by mistake
• Outputting original list without deletion

4. Given the code snippet below, what is the error when deleting the last node?

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

void deleteLast(Node*& head) {
  if (head == nullptr) return;
  Node* temp = head;
  while (temp->next != nullptr) {
    temp = temp->next;
  }
  delete temp;
  temp = nullptr;
}

medium

A. Uses wrong pointer type for deletion

B. Deletes head node instead of last node

C. Does not update previous node's next pointer to null

D. No error, code works correctly

Solution

1. Step 1: Analyze traversal to last node

   The loop moves temp to last node, but does not track previous node.

2. Step 2: Identify missing pointer update

   Deleting temp frees last node but previous node's next still points to freed memory, causing dangling pointer.

3. Final Answer:

   Does not update previous node's next pointer to null -> Option C

4. Quick Check:

   Previous node's next must be null after deletion [OK]

Hint: Track previous node to update next pointer before delete [OK]

Common Mistakes:

• Not tracking previous node in traversal
• Deleting node without updating links
• Setting temp to nullptr does not fix list

5. You have a singly linked list with only one node. What should happen when you delete the last node?

hard

A. Set head pointer to null

B. Set node's next pointer to null

C. Delete node but keep head pointing to it

D. Do nothing, list remains same

Solution

1. Step 1: Identify single node list condition

   Only one node means head points to that node and node's next is null.

2. Step 2: Delete node and update head

   Deleting the only node requires setting head to null to mark empty list.

3. Final Answer:

   Set head pointer to null -> Option A

4. Quick Check:

   Single node deleted means empty list head = null [OK]

Hint: Single node deletion empties list, head = null [OK]

Common Mistakes:

• Not setting head to null after deletion
• Trying to update next pointer of deleted node
• Leaving dangling pointer in head