ple Choices
State True or False:
(Choose 1 answer)
In a singly-linked list, there is no efficient way to insert a node before a given node in the middle or at the end of the list, but we can insert a node after a given node or at the beginning of the list with time complexity O(1).
A. False
B. True
I want to nisin the exam.
