a-b+c*(d/e-(f+g)) a-b+c*(d/e-+fg) a-b+c*(/de-+fg) a-b+c*-/de+fg a-b+*c-

Convert following infix expression to the prefix expression.
a - b + c * (d / e - (f + g))

Question Posted / madhu

Answer Posted / madhu

a-b+c*(d/e-(f+g))
a-b+c*(d/e-+fg)
a-b+c*(/de-+fg)
a-b+c*-/de+fg
a-b+*c-/de+fg
-ab+*c-/de+fg
+-ab*c-/de+fg

Is This Answer Correct ?

11 Yes

4 No

Please Help Members By Posting Answers For Below Questions

What is meant by deque?

489

Write a recursive c function to calculate the height of a binary tree.

491

Does treemap allow null keys?

480

What is copyonwritearraylist?

513

What is long data type?

471

Can arraylist have duplicates?

518

Define splay tree?

593

What is map data structure?

457

Which data structures are used in bfs and dfs algorithm?

554

How do you solve a selection sort?

499

Is there any difference between int[] a and int a[]?

563

Explain the uses of binary tree.

491

Is it possible to make an array volatile in java?

505

Which is the parent class of linkedhashset class?

519

Is selection sort greedy?

506