Q52
What is the time complexity of an infix to postfix conversion algorithm?
A.
O(N log N)
B.
O(N)
AnswerC.
O(N2)
D.
O(M log N)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board