search
Log In
0 votes
150 views

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 150 views

Please log in or register to answer this question.

Related questions

0 votes
1 answer
1
409 views
1. Is postorder same as Reverse polish notation(Postfix)? 2. Is inorder same as polish notation(infix)?
asked Dec 18, 2016 in DS rahul sharma 5 409 views
1 vote
1 answer
2
586 views
What we can do if the unary operator comes in infix notation while converting it into postfix/prefix notations? For example, this $a = -b+c*d/e+f↑g↑h-i*j$
asked Jan 18, 2017 in DS smartmeet 586 views
0 votes
1 answer
3
...