A

Admin • 833.24K Points
Coach

Q. What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

  • (A) o(1)
  • (B) o(n)
  • (C) θ (n)
  • (D) θ (1)

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.