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 ?

  1. A.

    O(1)

  2. B.

    O(log n)

  3. C.

    O(n log n)

  4. D.

    O(n)

  5. E.

    Question not attempted

Attempted by 737 students.

Sign up free to check your answer

Sign up free

Explore the full course: Rssb Senior Computer Instructor

Loading lesson…