+1 vote
in Data Structures & Algorithms I by (88.2k points)
Only infix expression can be made into an expression tree.

(a) true

(b) false

The doubt is from Trees in portion Trees of Data Structures & Algorithms I

I had been asked this question in an online interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
The correct answer is (b) false

For explanation: All infix, prefix and postfix expressions can be made into an expression tree using appropriate algorithms.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.