Question

Consider the following new - order strategy for traversing a binary tree:

The New - order traversal of the expression tree corresponding to the reverse polish expression 3 4 * 5 - 2 ^ 6 7 * 1 + - is given by

• A. - + 1 * 7 6 ^ 2 - 5 * 4 3
• B. + - 1 6 7 * 2 ^ 5 - 3 4 *
• C. - + 1 * 6 7 ^ 2 - 5 * 3 4
• D. 1 7 6 * 2 5 4 3 * - ^ -

Answer 1

The correct option is A - + 1 * 7 6 ^ 2 - 5 * 4 3

The expression is given in reverse polish notation i.e., post order.

Expression is 3 4 * 5 - 2 ^ 6 7 * 1 + -

Expression tree for above post order expression is


From the above expression tree NEW ORDER traversal is - + 1 * 7 6 ^ 2 - 5 * 4 3