You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?
(a) Delete the first element
(b) Insert a new element as a first element
(c) Delete the last element of the list
(d) Add a new element at the end of the list
This intriguing question originated from Singly Linked List Operations topic in section Abstract Data Types of Data Structures & Algorithms I
The question was posed to me during an online exam.