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