1.

What is the time complexity of an infix to postfix conversion algorithm?(a) O(N log N)(b) O(N)(c) O(N^2)(d) O(M log N)This is a very interesting question from Application of Stacks in portion Application of Stacks of Data Structures & Algorithms IThis question was addressed to me in unit test.

Answer» CORRECT choice is (b) O(N)

The best I can explain: The TIME complexity of an infix to POSTFIX EXPRESSION conversion algorithm is mathematically found to be O(N).


Discussion

No Comment Found

Related InterviewSolutions