Insert at End of Circular Linked List in DSA C++

Mental Model

A circular linked list connects the last node back to the first, forming a loop. Inserting at the end means adding a new node just before the first node, keeping the loop intact.

Analogy: Imagine people sitting in a circle holding hands. Adding a new person at the end means placing them just before the first person, so the circle stays unbroken.

head -> 1 -> 2 -> 3 -> (back to head 1)
          ↑                       ↓
          ← ← ← ← ← ← ← ← ← ← ← ←

Dry Run Walkthrough

Input: list: 1 -> 2 -> 3 (circular), insert value 4 at end

Goal: Add a new node with value 4 at the end, so the list becomes 1 -> 2 -> 3 -> 4 (circular)

Step 1: Create new node with value 4

head -> 1 -> 2 -> 3 -> (back to head 1), new_node[4]

Why: We need a new node to insert at the end

Step 2: Find last node (node with value 3) by traversing from head

head -> 1 -> 2 -> 3 [last] -> (back to head 1), new_node[4]

Why: To insert at end, we must link new node after last node

Step 3: Set last node's next pointer to new node

head -> 1 -> 2 -> 3 -> 4 [new end] -> (back to head 1)

Why: Link new node after last node to extend the circle

Step 4: Set new node's next pointer to head

head -> 1 -> 2 -> 3 -> 4 -> (back to head 1)

Why: Keep the list circular by linking new node back to head

Result:

head -> 1 -> 2 -> 3 -> 4 -> (back to head 1)

Annotated Code

DSA C++

#include <iostream>
using namespace std;

struct Node {
    int data;
    Node* next;
    Node(int val) : data(val), next(nullptr) {}
};

// Insert new node with value val at end of circular linked list
void insertAtEnd(Node*& head, int val) {
    Node* newNode = new Node(val); // create new node
    if (!head) { // empty list
        newNode->next = newNode; // points to itself
        head = newNode; // head points to new node
        return;
    }
    Node* curr = head;
    // find last node (node whose next is head)
    while (curr->next != head) {
        curr = curr->next; // advance curr to next node
    }
    curr->next = newNode; // link last node to new node
    newNode->next = head; // new node points back to head
}

// Print circular linked list starting from head
void printList(Node* head) {
    if (!head) {
        cout << "List is empty\n";
        return;
    }
    Node* curr = head;
    do {
        cout << curr->data << " -> ";
        curr = curr->next;
    } while (curr != head);
    cout << "(back to head " << head->data << ")\n";
}

int main() {
    Node* head = new Node(1);
    head->next = new Node(2);
    head->next->next = new Node(3);
    head->next->next->next = head; // make circular

    cout << "Original list:\n";
    printList(head);

    insertAtEnd(head, 4);

    cout << "After inserting 4 at end:\n";
    printList(head);

    return 0;
}

Node* newNode = new Node(val); // create new node

create new node with given value

if (!head) { newNode->next = newNode; head = newNode; return; }

handle empty list by pointing new node to itself and updating head

while (curr->next != head) { curr = curr->next; }

traverse to find last node whose next points to head

curr->next = newNode;

link last node to new node

newNode->next = head;

link new node back to head to maintain circularity

Output

Original list:

1 -> 2 -> 3 -> (back to head 1)

After inserting 4 at end:

1 -> 2 -> 3 -> 4 -> (back to head 1)

Complexity Analysis

Time: O(n) because we traverse all nodes once to find the last node

Space: O(1) because we only create one new node and use constant extra space

vs Alternative: Compared to singly linked list insertion at end which can be O(1) if tail pointer is maintained, this approach is O(n) without tail pointer

Edge Cases

empty circular linked list

new node points to itself and becomes head

DSA C++

if (!head) { newNode->next = newNode; head = newNode; return; }

single node circular linked list

new node inserted after the single node and points back to head

DSA C++

while (curr->next != head) { curr = curr->next; }

When to Use This Pattern

When you see a circular linked list and need to add a node at the end, use traversal to find the last node and link the new node before head to keep the circle.

Common Mistakes

Mistake: Not updating the new node's next pointer to head, breaking the circular link
Fix: Always set newNode->next = head after linking it to the last node

Mistake: Not handling empty list case, causing null pointer errors
Fix: Check if head is null and handle by pointing new node to itself and updating head

Summary

Inserts a new node at the end of a circular linked list while maintaining the circular link.

Use when you want to add elements to the end of a circular linked list.

The key is to find the last node and link the new node between it and the head.

Practice

1. What happens when you insert a new node at the end of an empty circular linked list?

easy

A. The new node points to itself, becoming the only node in the list.

B. The new node points to null, ending the list.

C. The new node is discarded because the list is empty.

D. The new node points to the head, but the list remains empty.

Solution

1. Step 1: Understand circular linked list empty state

   When the list is empty, there is no node, so the new node must point to itself to form a circle.

2. Step 2: Insert new node and update pointers

   The new node's next pointer is set to itself, making it the only node and the head of the list.

3. Final Answer:

   The new node points to itself, becoming the only node in the list. -> Option A

4. Quick Check:

   Empty list insertion creates a self-pointing node [OK]

Hint: New node points to itself if list is empty [OK]

Common Mistakes:

• Setting next pointer to null instead of itself
• Not updating the head pointer
• Assuming list remains empty after insertion

2. Which of the following is the correct syntax to insert a new node at the end of a circular linked list in C++?

easy

A. newNode->next = head; tail->next = newNode; tail = newNode;

B. newNode->next = nullptr; tail->next = newNode; tail = newNode;

C. newNode->next = tail; head->next = newNode; tail = newNode;

D. newNode->next = head; head->next = newNode; tail = newNode;

Solution

1. Step 1: Set new node's next to head

   In a circular linked list, the last node points to the head, so newNode->next = head.

2. Step 2: Update current tail's next and tail pointer

   Set tail->next to newNode to link the last node to new node, then update tail to newNode.

3. Final Answer:

   newNode->next = head; tail->next = newNode; tail = newNode; -> Option A

4. Quick Check:

   New node points to head, tail updated [OK]

Hint: Tail's next must point to new node, new node points to head [OK]

Common Mistakes:

• Setting newNode->next to nullptr instead of head
• Updating head->next instead of tail->next
• Not updating tail pointer after insertion

3. Given the circular linked list with nodes 10 -> 20 -> 30 -> (back to 10), what will be the list after inserting 40 at the end?

medium

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

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

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

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

Solution

1. Step 1: Identify current circular list structure

   The list is 10 -> 20 -> 30, and 30 points back to 10 forming a circle.

2. Step 2: Insert 40 at end and update pointers

   New node 40 points to head (10), old tail (30) points to 40, making list 10 -> 20 -> 30 -> 40 -> back to 10.

3. Final Answer:

   10 -> 20 -> 30 -> 40 -> (back to 10) -> Option D

4. Quick Check:

   New node added at end, circle maintained [OK]

Hint: New node points to head, old tail points to new node [OK]

Common Mistakes:

• Breaking the circle by pointing last node to null
• Inserting new node at start instead of end
• Not updating tail pointer

4. What is wrong with this code snippet for inserting at the end of a circular linked list?

void insertEnd(Node*& tail, int data) {
  Node* newNode = new Node(data);
  newNode->next = tail->next;
  tail = newNode;
}

medium

A. It sets newNode->next to null instead of head.

B. It deletes the old tail node accidentally.

C. It does not update the old tail's next pointer to newNode.

D. It inserts the new node at the beginning instead of the end.

Solution

1. Step 1: Check pointer updates in code

   The code sets newNode->next to tail->next (head), but does not update tail->next to newNode.

2. Step 2: Identify missing link update

   Without updating old tail's next pointer, the list breaks the circle and newNode is not linked properly.

3. Final Answer:

   It does not update the old tail's next pointer to newNode. -> Option C

4. Quick Check:

   Old tail's next must point to new node [OK]

Hint: Always update old tail's next to new node [OK]

Common Mistakes:

• Forgetting to update old tail's next pointer
• Setting newNode->next incorrectly
• Not updating tail pointer after insertion

5. You have a circular linked list with nodes 5 -> 15 -> 25 -> (back to 5). You want to insert a new node with value 35 at the end. After insertion, you mistakenly forget to update the tail pointer to the new node. What will be the effect on the list?

hard

A. The list will have 5 -> 15 -> 25 -> (back to 5) without 35.

B. The list will have 5 -> 15 -> 25 -> 35 -> (back to 5), but tail still points to 25.

C. The new node 35 will not be linked and will be lost.

D. The list will break and become linear ending at 25.

Solution

1. Step 1: Insert new node and link old tail

   New node 35 is linked after 25, and points back to head (5), so list is 5 -> 15 -> 25 -> 35 -> back to 5.

2. Step 2: Tail pointer not updated

   Tail still points to 25, so operations relying on tail may behave incorrectly, but list structure is intact.

3. Final Answer:

   The list will have 5 -> 15 -> 25 -> 35 -> (back to 5), but tail still points to 25. -> Option B

4. Quick Check:

   Tail pointer must update, else points to old last node [OK]

Hint: Tail pointer must update to new node after insertion [OK]

Common Mistakes:

• Assuming list breaks without tail update
• Thinking new node is lost if tail not updated
• Confusing tail pointer with node links