The time complexity for performing a PUSH and POP operation on a stack…

GPSC College Teaching (CS/IT) 2025

The time complexity for performing a PUSH and POP operation on a stack implemented using a singly-linked list are ______ and _____ respectively.

  1. A.

    O(N)O(N) and O(1)O(1)

  2. B.

    O(N)O(N) and O(N)O(N)

  3. C.

    O(1)O(1) and O(1)O(1)

  4. D.

    O(N)O(N) and O(Nlog⁡(N))O(N\log(N))

Attempted by 23 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…