Question

For the given expression tree, write the correct postfix expression.

(a) abc*+

(b) abc+*

(c) ab+c*

(d) a+bc*

I want to ask this question from Application of Stacks topic in section Application of Stacks of Data Structures & Algorithms I

This question was addressed to me during an interview for a job.

Answer 1

Correct answer is (a) abc*+

To explain: Evaluating the given expression tree gives the infix expression a+b*c. Converting it to postfix, we get, abc*+.