Insert at End Tail Insert in DSA C - Time & Space Complexity

Time Complexity: Insert at End Tail Insert

O(n)

Understanding Time Complexity

We want to understand how the time to add a new item at the end of a linked list changes as the list grows.

How does the number of steps grow when we insert at the tail?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

// Insert a new node at the end of a singly linked list
void insertAtEnd(Node** head, int data) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->data = data;
    newNode->next = NULL;

    if (*head == NULL) {
        *head = newNode;
        return;
    }

    Node* temp = *head;
    while (temp->next != NULL) {
        temp = temp->next;
    }
    temp->next = newNode;
}
    

This code creates a new node and adds it to the end of a singly linked list by traversing from the head.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: The while loop that moves through each node until the last one.
• How many times: It runs once for each node in the list until the end, so n times if the list has n nodes.

How Execution Grows With Input

As the list gets longer, the time to find the end grows linearly because we check each node one by one.

Input Size (n)	Approx. Operations
10	About 10 steps to reach the end
100	About 100 steps to reach the end
1000	About 1000 steps to reach the end

Pattern observation: The steps increase directly with the number of nodes, so doubling nodes doubles the work.

Final Time Complexity

Time Complexity: O(n)

This means the time to insert at the end grows in direct proportion to the list size.

Common Mistake

[X] Wrong: "Inserting at the end is always fast and takes constant time."

[OK] Correct: Without a pointer to the last node, we must walk through the whole list, so time grows with list length.

Interview Connect

Understanding this helps you explain why adding at the tail can be slow without extra pointers, showing you know how data structure design affects speed.

Self-Check

"What if we kept a pointer to the last node (tail) in the list? How would the time complexity change?"

Practice

1. What does the 'Insert at End' operation do in a singly linked list?

easy

A. Adds a new node at the end (tail) of the list

B. Deletes the last node of the list

C. Adds a new node at the beginning (head) of the list

D. Searches for a node at the end of the list

Solution

1. Step 1: Understand the operation

   Inserting at the end means adding a new node after the current last node.

2. Step 2: Identify the effect on the list

   The new node becomes the new tail, extending the list by one node.

3. Final Answer:

   Adds a new node at the end (tail) of the list -> Option A

4. Quick Check:

   Insert at end = Add node at tail [OK]

Hint: Insert at end means add after last node [OK]

Common Mistakes:

• Confusing insert at end with insert at beginning
• Thinking it deletes a node
• Assuming it searches instead of inserts

2. Which of the following is the correct syntax to create a new node in C for tail insertion?

easy

A. newNode = malloc(sizeof(Node));

B. struct Node newNode = malloc(sizeof(struct Node));

C. Node newNode = malloc(sizeof(Node));

D. struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));

Solution

1. Step 1: Understand node creation in C

   We use malloc to allocate memory and cast it to pointer of struct Node.

2. Step 2: Check syntax correctness

   struct Node* newNode = (struct Node*)malloc(sizeof(struct Node)); correctly casts malloc result to (struct Node*) and uses sizeof(struct Node).

3. Final Answer:

   struct Node* newNode = (struct Node*)malloc(sizeof(struct Node)); -> Option D

4. Quick Check:

   Correct malloc and cast syntax = struct Node* newNode = (struct Node*)malloc(sizeof(struct Node)); [OK]

Hint: Use malloc with (struct Node*) cast for new node [OK]

Common Mistakes:

• Missing cast to (struct Node*)
• Using wrong type without struct keyword
• Assigning malloc to struct variable instead of pointer

3. What will be the output linked list after inserting 4 at the end of the list 1 -> 2 -> 3 -> NULL using tail insertion?

medium

A. 1 -> 2 -> 3 -> NULL

B. 1 -> 2 -> 3 -> 4 -> NULL

C. 1 -> 2 -> 4 -> 3 -> NULL

D. 4 -> 1 -> 2 -> 3 -> NULL

Solution

1. Step 1: Understand tail insertion effect

   Inserting 4 at the end adds it after 3, the current tail.

2. Step 2: Visualize the new list

   The list becomes 1 -> 2 -> 3 -> 4 -> NULL after insertion.

3. Final Answer:

   1 -> 2 -> 3 -> 4 -> NULL -> Option B

4. Quick Check:

   Insert 4 at tail = 1->2->3->4->NULL [OK]

Hint: New node goes after last node, not at front [OK]

Common Mistakes:

• Inserting at head instead of tail
• Placing new node in middle
• Not updating tail pointer

4. Given the following code snippet for tail insertion, what is the error?

void insertAtEnd(struct Node** head, int data) {
  struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
  newNode->data = data;
  newNode->next = NULL;
  if (*head == NULL) {
    *head = newNode;
  } else {
    struct Node* temp = *head;
    while (temp->next != NULL) {
      temp = temp->next;
    }
    temp = newNode;
  }
}

medium

A. temp = newNode; does not link newNode to the list

B. Missing malloc for newNode

C. newNode->next should not be NULL

D. Head pointer is not updated when list is empty

Solution

1. Step 1: Analyze the while loop and insertion

   The code moves temp to last node, but then does temp = newNode; which only changes temp pointer.

2. Step 2: Identify correct linking

   To link newNode, temp->next should be assigned newNode, not temp itself.

3. Final Answer:

   temp = newNode; does not link newNode to the list -> Option A

4. Quick Check:

   Link newNode by temp->next = newNode [OK]

Hint: Assign newNode to temp->next, not temp [OK]

Common Mistakes:

• Assigning newNode to temp pointer instead of temp->next
• Forgetting to set newNode->next to NULL
• Not handling empty list case

5. You have a singly linked list with nodes 10 -> 20 -> 30 -> NULL. You want to insert 40 at the end using tail insertion. Which of the following code snippets correctly performs this insertion and updates the list?

hard

A. struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));\nnewNode->data = 40;\nnewNode->next = NULL;\nhead = newNode;

B. struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));\nnewNode->data = 40;\nnewNode->next = head;\nhead = newNode;

C. struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));\nnewNode->data = 40;\nnewNode->next = NULL;\nstruct Node* temp = head;\nwhile(temp->next != NULL) { temp = temp->next; }\ntemp->next = newNode;

D. struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));\nnewNode->data = 40;\nnewNode->next = NULL;\nstruct Node* temp = head;\nwhile(temp != NULL) { temp = temp->next; }\ntemp->next = newNode;

Solution

1. Step 1: Create new node with data 40 and next NULL

   This prepares the new node to be added at the end.

2. Step 2: Traverse list to last node

   Using while(temp->next != NULL) moves temp to last node (30).

3. Step 3: Link last node's next to newNode

   temp->next = newNode correctly attaches new node at end.

4. Final Answer:

   Traverse to last node with while(temp->next != NULL), then temp->next = newNode -> Option C

5. Quick Check:

   Traverse to tail, then temp->next = newNode [OK]

Hint: Traverse to last node, then link new node at next [OK]

Common Mistakes:

• Setting newNode->next to head (inserts at front)
• Not updating last node's next pointer
• Loop condition allowing temp to become NULL