Askmeabout

Lets share our knowledge

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

Q & A › Category: Data Structure › What is the time complexity of an infix to postfix conversion algorithm?
0 Vote Up Vote Down
Admin Staff asked 5 years ago

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)

Question Tags:
1 Answers
0 Vote Up Vote Down
Admin Staff answered 5 years ago

b) O(N)