# Made Easy Test Series: Algorithm-Reverse Polish Notation

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

## Related questions

1
409 views
1. Is postorder same as Reverse polish notation(Postfix)? 2. Is inorder same as polish notation(infix)?
1 vote
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$
Consider a procedure $find()$ which take array of $n$ ... Here we need to sort first and then need to compare adjacent element right?? Then what will be complexity??