Q.

What is the time complexity of evaluation of postfix expression algorithm?

A. o (n)
B. o (n log n)
C. o (n2)
D. o (m log n)
Answer» A. o (n)
Explanation: the time complexity of evaluation of infix, prefix and postfix expressions is o (n).
780
0
Do you find this helpful?
3

Discussion

No comments yet