in Compiler Design
573 views
1 vote
1 vote

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??

in Compiler Design
by
573 views

4 Comments

1
1

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

is this the answer?

1
1

@robinofautumn Yes, it is

1
1

Please log in or register to answer this question.