What is the time complexity of an infix to postfix conversion algorithm?

BPSC TRE · TRE 1.0 · PGT (Classes 11–12) · Computer Science · 26 Aug 2023 · Shift 2 · Subject

1. A.

   O(N log N)

2. B.

   O(N)

3. C.

   O(N2)

4. D.

   More than one of the above

5. E.

   None of the above

Attempted by 1807 students.