Mastering Single Linked List Operations

In a singly linked list, each node contains which of the following?

• Only data

• Data and a pointer to the previous node

• Data and a pointer to the next node

• Only a pointer to the next node

What is the time complexity of inserting a node at the beginning of a singly linked list?

When inserting a node at the beginning of a singly linked list, which of the following steps is performed first?

• Set the new node's next pointer to NULL

• Set the new node's next pointer to the current head

• Update the tail pointer to the new node

• Traverse the entire list to find the position

When inserting a node at the end of a singly linked list, the next pointer of the last node should be set to:

• The head node

• The new node

• NULL

• The second last node

Consider a singly linked list: 10 → 20 → 30 → NULL. After inserting 5 at the beginning, what will the list look like?

• 10 → 5 → 20 → 30 → NULL

• 5 → 10 → 20 → 30 → NULL

• 10 → 20 → 30 → 5 → NULL

• 5 → 20 → 30 → NULL

Consider a singly linked list: 10 → 20 → 30 → NULL. After inserting 40 at the end, what will the list look like?

• 40 → 10 → 20 → 30 → NULL

• 10 → 40 → 20 → 30 → NULL

• 10 → 20 → 30 → 40 → NULL

• 10 → 20 → 40 → 30 → NULL

To delete a node with a specific value from a singly linked list, which pointer must be updated?

• The next pointer of the node before the target node

• The next pointer of the target node itself

• The next pointer of the node after the target node

• The head pointer always

Consider a singly linked list: 10 → 20 → 30 → 40 → NULL. After deleting the node with value 20, what will the list look like?

• 10 → 30 → 40 → NULL

• 20 → 30 → 40 → NULL

• 10 → 20 → 40 → NULL

• 10 → 40 → NULL

What happens when you try to delete the head node from a singly linked list?

• The list becomes empty immediately

• The second node becomes the new head

• The last node becomes the new head

• The head pointer remains unchanged