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)

💬 Discuss

✅ Correct Answer: (A) o (n)

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

Published by Mr. Dubey ⭐ 111.54K Points at 17-Sep-2023 08:19 am in Information Retrival Techniques

Explanation by: Mr. Dubey

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

💬 Discussion

📊 Question Analytics

👁️

521

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

96%

Success Rate