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

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

Question Posted / lucky

Answer Posted / lucky

a-b+c*(d/e-(f+g))
a-b+c*(d/e-+fg)
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

Is This Answer Correct ?

14 Yes

4 No

Please Help Members By Posting Answers For Below Questions

Is treeset synchronized?

804

Does treemap sort automatically?

901

Explain what is the data structures used to perform recursion?

918

Which sort is best for linked list?

833

What is the use of data structure?

894

Does treemap allow duplicate keys?

807

Can value be null in treemap?

861

What is difference between list and linked list?

924

What is meant by heap sort?

842

When new data are to be inserted into a data structure?

894

Is arraylist a class?

934

What type of memory allocation is referred for Linked lists?

1155

What do you mean by an Array?

918

What is a undirected graph?

937

What is sorting in math?

889