Consider the following New-order strategy for traversing a binary tree: Visit…

GATE · 2016 · CS · Set 2 · Computer Science & IT

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:

  1. A.

    + - 1 6 7 * 2 ˆ 5 - 3 4 *

  2. B.

    - + 1 * 6 7 ˆ 2 - 5 * 3 4

  3. C.

    - + 1 * 7 6 ˆ 2 - 5 * 4 3

  4. D.

    1 7 6 * + 2 5 4 3 * - ˆ -

Attempted by 254 students.

Show answer

Correct answer: C

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…