A

Admin • 833K Points
Coach

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)

Explanation by: Admin

the time complexity of evaluation of infix, prefix and postfix expressions is o (n).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.