Insert at End of Circular Linked List in DSA C# - Time & Space Complexity

Time Complexity: Insert at End of Circular Linked List

O(1)

Understanding Time Complexity

We want to understand how the time to insert a node at the end of a circular linked list changes as the list grows.

How does the number of steps grow when the list gets bigger?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

public class Node {
    public int data;
    public Node next;
    public Node(int data) { this.data = data; this.next = null; }
}

public class CircularLinkedList {
    public Node tail;

    public void InsertAtEnd(int value) {
        Node newNode = new Node(value);
        if (tail == null) {
            tail = newNode;
            tail.next = tail;
        } else {
            newNode.next = tail.next;
            tail.next = newNode;
            tail = newNode;
        }
    }
}
    

This code inserts a new node at the end of a circular linked list by adjusting pointers.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Pointer updates to insert the new node.
• How many times: These pointer changes happen only once per insertion, no loops or traversals.

How Execution Grows With Input

Since the insertion does not require walking through the list, the steps stay the same no matter how big the list is.

Input Size (n)	Approx. Operations
10	3-4 pointer updates
100	3-4 pointer updates
1000	3-4 pointer updates

Pattern observation: The number of operations stays constant as the list grows.

Final Time Complexity

Time Complexity: O(1)

This means inserting at the end takes the same amount of time no matter how many nodes are in the list.

Common Mistake

[X] Wrong: "Inserting at the end requires walking through all nodes, so it takes longer as the list grows."

[OK] Correct: Because we keep a reference to the tail node, we can insert directly without traversal, so the time stays constant.

Interview Connect

Knowing how to insert efficiently in circular linked lists shows you understand pointer management and can optimize operations, a useful skill in many coding problems.

Self-Check

"What if we did not keep a tail pointer and only had a head pointer? How would the time complexity change?"

Practice

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

easy

A. The new node points back to the head, maintaining the circular structure.

B. The new node points to null, breaking the circular structure.

C. The new node becomes the head and points to null.

D. The new node is inserted at the beginning, not the end.

Solution

1. Step 1: Understand circular linked list structure

   In a circular linked list, the last node points back to the head node, forming a loop.

2. Step 2: Insert new node at the end

   The new node is linked after the current last node, and its next pointer is set to the head, preserving the circle.

3. Final Answer:

   The new node points back to the head, maintaining the circular structure. -> Option A

4. Quick Check:

   New node next = head keeps list circular [OK]

Hint: New end node must link to head to keep circle [OK]

Common Mistakes:

• Setting new node's next to null breaks the circle
• Inserting new node at head instead of end
• Forgetting to update last node's next pointer

2. Which of the following C# code snippets correctly inserts a new node at the end of a circular linked list?

easy

A. newNode.next = head; lastNode.next = newNode;

B. newNode.next = null; lastNode.next = newNode;

C. newNode.next = lastNode; head.next = newNode;

D. newNode.next = head.next; lastNode.next = head;

Solution

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

   To maintain circularity, newNode.next must point to head node.

2. Step 2: Link last node to new node

   Update lastNode.next to newNode to insert at end.

3. Final Answer:

   newNode.next = head; lastNode.next = newNode; -> Option A

4. Quick Check:

   New node points to head, last node points to new node [OK]

Hint: New node next = head; last node next = new node [OK]

Common Mistakes:

• Setting new node next to null breaks circle
• Linking new node to last node instead of head
• Not updating last node's next pointer

3. Given the circular linked list: 10 -> 20 -> 30 -> back to 10, what is 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 -> back to 10

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

Solution

1. Step 1: Identify current circular list

   List is 10 -> 20 -> 30, last node 30 points back to 10.

2. Step 2: Insert 40 at end

   New node 40 is linked after 30, and 40 points back to 10 to keep circle.

3. Final Answer:

   10 -> 20 -> 30 -> 40 -> back to 10 -> Option C

4. Quick Check:

   New node added at end, circle maintained [OK]

Hint: New node added after last, points to head [OK]

Common Mistakes:

• Making new node head instead of last
• Breaking circle by pointing new node to null
• Forgetting to update last node's next pointer

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

newNode.next = null;
lastNode.next = newNode;
newNode.next = head;

medium

A. The code correctly inserts the node without issues.

B. Setting newNode.next to null breaks the circular link temporarily.

C. newNode.next should point to lastNode, not head.

D. lastNode.next should not be updated before newNode.next.

Solution

1. Step 1: Analyze newNode.next assignment

   Setting newNode.next = null breaks the circular link temporarily, which is unnecessary.

2. Step 2: Check order of pointer updates

   Correct insertion requires newNode.next to point to head immediately to maintain circle.

3. Final Answer:

   Setting newNode.next to null breaks the circular link temporarily. -> Option B

4. Quick Check:

   newNode.next must never be null in circular list [OK]

Hint: Never set new node's next to null in circular list [OK]

Common Mistakes:

• Assigning null to newNode.next
• Updating lastNode.next before setting newNode.next
• Confusing pointer directions

5. You have a circular linked list with only one node (value 5) pointing to itself. After inserting a new node with value 10 at the end, what is the correct structure?

hard

A. 5 -> 10 -> null

B. 5 -> back to 10 -> back to 5

C. 10 -> 5 -> back to 10

D. 5 -> 10 -> back to 5

Solution

1. Step 1: Understand single-node circular list

   Initially, node 5 points to itself, forming a circle.

2. Step 2: Insert new node 10 at end

   New node 10 is linked after 5, and 10 points back to 5 to maintain circularity.

3. Final Answer:

   5 -> 10 -> back to 5 -> Option D

4. Quick Check:

   Two nodes linked circularly, last points to head [OK]

Hint: New node next = head even if list has one node [OK]

Common Mistakes:

• Pointing new node to null instead of head
• Not updating original node's next pointer
• Confusing order of nodes after insertion