Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list?
(a) Possible if X is not last node
(b) Possible if size of linked list is even
(c) Possible if size of linked list is odd
(d) Possible if X is not first node
My question is from Singly Linked List Operations topic in division Abstract Data Types of Data Structures & Algorithms I
I had been asked this question by my college director while I was bunking the class.