Data Structures | Binary Trees | Question 15

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