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 binary tree a bst?

902

Why do we need linked lists?

926

Explain different methods in which you can traverse a tree?

908

What is the use of treemap?

940

Which is the parent class of printerstatereasons class?

884

What is the difference between push and pop?

1096

Does treeset allow null values?

884

What is the slowest sorting algorithm?

905

Does hashmap allow null keys?

862

Is binary tree balanced?

832

Write a program using mergesort technique.

1005

Which sorting is best and why?

896

What data type is enum?

909

What is the height of a binary tree?

935

What is collections singletonlist?

868