Skip to content
Related Articles

Related Articles

Data Structures | Binary Trees | Question 15

Improve Article
Save Article
  • Difficulty Level : Basic
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article

If arity of operators is fixed, then which of the following notations can be used to parse expressions without parentheses?

a) Infix Notation (Inorder traversal of a expression tree)
b) Postfix Notation (Postorder traversal of a expression tree)
c) Prefix Notation (Preorder traversal of a expression tree)

(A) b and c
(B) Only b
(C) a, b and c
(D) None of them


Answer: (A)

Explanation: See Polish notation

Quiz of this Question

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!