Consider a singly linked list containing n nodes in which only the head…
PYQ RSSB Computer Instructor 2026Modified — slightly modified from the official paper; see the solution
Consider a singly linked list containing n nodes in which only the head pointer is maintained. What is the worst-case time complexity of inserting a new node at the end of the list ?
- A.
O(1)
- B.
O(log n)
- C.
O(n log n)
- D.
O(n)
- E.
Question not attempted
Attempted by 737 students.
Sign up free to check your answer
Sign up freeLoading lesson…

