+1 vote
in Data Structures & Algorithms I by (88.2k points)
An expression tree is created using?

(a) postfix expression

(b) prefix expression

(c) infix expression

(d) paranthesized expression

This is a very interesting question from Trees in portion Trees of Data Structures & Algorithms I

This question was posed to me in an interview for internship.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct choice is (a) postfix expression

For explanation: A postfix expression is converted into an expression tree by reading one symbol at a time and constructing a tree respectively.

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.

Categories

...