edited by
12,988 views

3 Answers

Best answer
13 votes
13 votes
$( a + ( b - c ) ) * ( ( d - e ) / ( f + g - h ) )$

$( a + ( b - c ) ) * ( ( - de) / ( ( + f g) - h ) )$

$( a + ( - bc ) ) * ( ( - de ) / ( - + f g h ) )$

$( + a - b c)  *  ( / - d e - + f g h)$

$* + a - b c / - d e - + f g h$

Option $A$ will be correct.
edited by
3 votes
3 votes

To find the equivalent prefix form (or Polish Notation):

1) The given expression is in infix form i.e. fully parenthesized unambigous expression

2) Firstly,we have to make a rooted binary tree for the given expression

3) Then we have to apply Preorder Tree Traversals

4) The obtained expression would be an equivalent prefix or polish notation

On solving we can check that A is the correct answer...

Answer:

Related questions

6 votes
6 votes
1 answer
1
sh!va asked May 7, 2017
18,571 views
The best data structure to check whether an arithmetic expression has balanced parenthesis is a:QueueStackTreeList