What is the time complexity of an infix to postfix conversion algorithm?
A. O(N log N)
B. O(N)
C. O(N2)
D. O(M log N)
Answer:B
What is the time complexity of an infix to postfix conversion algorithm?
A. O(N log N) B. O(N) C. O(N2) D. O(M log N)