Q11_50_20250728130304.webp

☑Kizspy.me
Answer (Choose 1 answer)
☐ A
What is the time complexity to insert a new node at the end of a singly linked list if the tail pointer is not
maintained?
A. O(1)
B. O(n)
C. O(log n)
D. O(nlog n)
Back
Next
FUQ.sh
sh the exam.