Question 12
Consider the following linked list structure, where each node is an object of the given class and it has a pointer that points to the first node of the linked list and a pointer that points to the last node of the linked list.
Which of the following operations can be completed in O(1) (constant) time.
Delete the last node from the list.
Insert a new node immediately after the first node.
Insert a new node at the end of the list.
Delete a specific node given only its data value.