+1 vote
in Data Structures & Algorithms I by (110k points)
From the given Expression tree, identify the correct postfix expression from the list of options.

(a) ab*cd*+

(b) ab*cd-+

(c) abcd-*+

(d) ab*+cd-

The origin of the question is Application of Stacks in division Application of Stacks of Data Structures & Algorithms I

This question was posed to me in semester exam.

1 Answer

+1 vote
by (408k points)
selected by
Best answer
The correct option is (b) ab*cd-+

For explanation: From the given expression tree, the infix expression is found to be (a*b)+(c-d). Converting it to postfix, we get, ab*cd-+.

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.