Consider the following New-order strategy for traversing a binary tree: Visit the root; Visit the right subtree using New-order; Visit the left subtree using New-order; The New-order traversal of the expression tree corresponding to the reverse polish expression 3 4 * 5 – 2 ^ 6 7 * 1 + - is given by:

Correct Answer is : – + 1 * 7 6 ^ 2 – 5 * 4 3

GATE Computer Science (CS) 2016 Shift 2 Solved Paper

Question : 46 of 65

Marks: +1, -0

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:

Go to Question:

Prev Question

Next Question