Consider that a pointer to a node X in a singly linear linked list is given. Pointers to head node is not given, can we delete the node X from given singly linear linked list?
A. Possible if X is not last node in the linked list. Apply two steps, first copy the data of next of X to X , second delete next of X .
B. Possible if size of linked list is known prior.
C. Possible if size of linked list is odd
D. Possible if X is not first node in the linked list. Apply two steps, first copy the data of next of $X$ to $X$, second delete next of $X$.