1.

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 IThis question was posed to me in semester exam.

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-+.



Discussion

No Comment Found

Related InterviewSolutions