+1 vote
in Data Structures & Algorithms I by (88.2k points)
The expression obtained by recursively producing a left expression, followed by an operator, followed by recursively producing a right expression is called?

(a) prefix expression

(b) infix expression

(c) postfix expression

(d) paranthesized expression

My query is from Trees topic in portion Trees of Data Structures & Algorithms I

This question was addressed to me in examination.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct choice is (b) infix expression

For explanation: It is an infix expression because the format of an infix expression is given by operand-operator-operand.

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

...