Why Delete a Node from Circular Linked List in DSA C?

The Big Idea

What if removing one friend from a circle could break the whole game? Let's see how to avoid that!

The Scenario

Imagine you have a group of friends sitting in a circle, passing a ball around. Now, one friend needs to leave the circle. If you try to remove that friend by just telling everyone to skip them manually, it gets confusing and slow, especially if the circle is big.

The Problem

Manually updating who passes the ball to whom is slow and easy to mess up. You might forget to tell someone, or accidentally break the circle, causing the ball to get lost. This makes the whole game stop working properly.

The Solution

Using a circular linked list, we can remove a friend (node) by carefully changing just a few links. This keeps the circle intact and the ball keeps moving smoothly without confusion or mistakes.

Before vs After

✗ Before

for (int i = 0; i < size; i++) {
  if (friends[i] == leavingFriend) {
    // manually shift all friends after i
  }
}

✓ After

void deleteNode(Node** head, int key) {
  // find node with key and update links to remove it
}

What It Enables

This lets us efficiently remove any member from a circular group without breaking the loop or losing track.

Real Life Example

In a multiplayer game where players take turns in a circle, if a player leaves, the game must quickly remove them and continue without stopping or errors.

Key Takeaways

Manual removal in a circle is slow and error-prone.

Deleting a node in a circular linked list updates links to keep the circle intact.

This operation keeps circular processes running smoothly.

Practice

1. What happens when you delete the only node in a circular linked list?

easy

A. The list becomes empty (head = NULL)

B. The list still contains one node pointing to itself

C. The list becomes a linear linked list

D. The list throws an error

Solution

1. Step 1: Understand the structure of a single-node circular linked list

   It has one node whose next pointer points to itself.

2. Step 2: Delete the only node

   After deletion, no nodes remain, so the head pointer must be set to NULL to indicate an empty list.

3. Final Answer:

   The list becomes empty (head = NULL) -> Option A

4. Quick Check:

   Single node deleted means empty list [OK]

Hint: Deleting last node empties list, set head to NULL [OK]

Common Mistakes:

• Not setting head to NULL after deleting the only node
• Assuming list still has one node after deletion
• Confusing circular list with linear list after deletion

2. Which of the following is the correct syntax to delete the head node in a circular linked list in C?

easy

A. head = NULL; free(head);

B. head->next = NULL; free(head);

C. free(head); head = NULL;

D. Node* oldHead = head; head = head->next; free(oldHead);

Solution

1. Step 1: Understand deletion of head node in circular linked list

   We must move head pointer to next node and free the old head node.

2. Step 2: Check syntax correctness

   Node* oldHead = head; head = head->next; free(oldHead); correctly assigns head to head->next and frees the old head pointer stored separately.

3. Final Answer:

   Node* oldHead = head; head = head->next; free(oldHead); -> Option D

4. Quick Check:

   Move head, free old node [OK]

Hint: Move head to next, then free old head [OK]

Common Mistakes:

• Freeing head before moving pointer
• Setting next pointer to NULL breaks circular link
• Freeing NULL pointer

3. Given the circular linked list: 10 -> 20 -> 30 -> (back to 10), what is the list after deleting node with value 20?

medium

A. 10 -> 20 -> 30 -> (back to 10)

B. 20 -> 30 -> (back to 20)

C. 10 -> 30 -> (back to 10)

D. 30 -> 10 -> (back to 30)

Solution

1. Step 1: Identify node to delete and its neighbors

   Node with value 20 is between 10 and 30.

2. Step 2: Adjust pointers to remove node 20

   Set 10's next pointer to 30, skipping 20, maintaining circular link.

3. Final Answer:

   10 -> 30 -> (back to 10) -> Option C

4. Quick Check:

   Removed 20, linked 10 to 30 [OK]

Hint: Link previous node to next of deleted node [OK]

Common Mistakes:

• Not updating previous node's next pointer
• Breaking circular link by setting next to NULL
• Deleting wrong node

4. What is wrong with this code snippet for deleting a node with value 15 from a circular linked list?

void deleteNode(Node** head, int key) {
  Node* curr = *head;
  Node* prev = NULL;
  while (curr->data != key) {
    prev = curr;
    curr = curr->next;
  }
  prev->next = curr->next;
  free(curr);
}

medium

A. It does not handle deleting the head node correctly

B. It frees the wrong node

C. It causes infinite loop always

D. It sets head to NULL incorrectly

Solution

1. Step 1: Analyze deletion logic for head node

   If the node to delete is head, prev is NULL, so prev->next causes error.

2. Step 2: Identify missing head update

   Code does not update *head when deleting head node, causing incorrect list state.

3. Final Answer:

   It does not handle deleting the head node correctly -> Option A

4. Quick Check:

   Head deletion needs special handling [OK]

Hint: Check if node to delete is head before pointer update [OK]

Common Mistakes:

• Not updating head pointer when deleting head
• Dereferencing NULL prev pointer
• Not checking if node exists before deletion

5. You have a circular linked list with nodes: 5 -> 10 -> 15 -> 20 -> (back to 5). You want to delete the node with value 5 (head node). Which steps correctly delete the head and maintain the circular list?

hard

A. Set head to head->next, free old head, leave last node's next unchanged

B. Find last node, set its next to head->next, free head, update head to head->next

C. Free head, set head to NULL, list becomes empty

D. Set head->next to NULL, free head, update head to next node

Solution

1. Step 1: Locate last node in circular list

   Traverse nodes until node whose next points to head is found (node with value 20).

2. Step 2: Update last node's next pointer and head

   Set last node's next to head->next (node with value 10), free old head, and update head pointer to head->next.

3. Final Answer:

   Find last node, set its next to head->next, free head, update head to head->next -> Option B

4. Quick Check:

   Last node points to new head after deletion [OK]

Hint: Update last node's next before freeing head [OK]

Common Mistakes:

• Not updating last node's next pointer
• Freeing head before updating pointers
• Breaking circular link by setting next to NULL