Q1_1_20250904125437.webp

☑Kizspy.me
(Choose 1 answer)
☐ A
Select the statement that is most correct.
Basically, the complexity of inserting a node after a given node in a singly linked lists is
A. O(n)
B. O(1)
C. O(log n)
D. O(n^2)
Back
Next
FUQ.sh
sh the exam.