(Choose 2 answers)
Which statements are true (select two):
A. In a singly-linked list there is no efficient way to insert a node before a given node in the r (the action is considered efficient if it's complexity is O(1)).
B. In a singly-linked list we can insert a node after a given node with time complexity O(1)
C. In a singly-linked list we can insert a node after a given node with time complexity O(n)
D. In a singly-linked list we can insert a node before a given node in the middle of the list w 0(1)
(17)
