0 votes

Consider the 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 expression tree corresponding to the reverse polish expression

3 4 * 5 – 2 ^ 6 7 * 1 + –

What will be expression, any procedure for it??