Register

Made Easy Test Series: Algorithm-Reverse Polish Notation

1,011 views
1 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??

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Made Easy Test Serie...Next → · Permutation & Combin...
← Previous in category · Made Easy Test Serie...Next in category → · Compiler design Self...
Position:
Show:

Related questions

0 0 votes
1 1 answer
2.0k
2.0k views
rahul sharma 5 asked Dec 18, 2016
1,956 views
Postorder vs Reverse polish notation
1. Is postorder same as Reverse polish notation(Postfix)?2. Is inorder same as polish notation(infix)?
0 0 votes
1 1 answer
1.1k
1.1k views
Arunava Samanta asked Jun 28, 2022
1,142 views
The expression in postfix notation corresponding to the prefix notation ++A*B+CD*+EFG is
1 1 vote
2 2 answers
1.5k
1.5k views
smartmeet asked Jan 18, 2017
1,452 views
Virtual Gate Test Series: Programming & DS - Infix Notation
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$
1 1 vote
1 1 answer
3.6k
3.6k views
JaiKumar Guwalani asked May 6, 2018
3,599 views
Evaluation of Postfix expression using stack
What is time and space complexity to evaluate postfix expression ?