a-b+c*(/de-(+fg)) a-b+c*(t-s) if t=/de;s=+fg a-b+c*(-ts) -ab+*c-ts +-ab

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

Question Posted / p.divya poojitha

Answer Posted / p.divya poojitha

a-b+c*(/de-(+fg))
a-b+c*(t-s) if t=/de;s=+fg
a-b+c*(-ts)
-ab+*c-ts
+-ab*c-ts
sol is +-ab*c-/de+fg

Is This Answer Correct ?

0 Yes

1 No

Please Help Members By Posting Answers For Below Questions

Why is quicksort so fast?

898

Can we override compareto method for enumerations?

1014

Describe the complexity of Binary search

917

How many parts are there in a declaration statement?

1007

Is vector synchronized?

926

Why is hashmap used?

960

What do you mean by general trees?

1023

Define an algorithm. What are the properties of an algorithm?

1070

What is time complexity of hashmap?

1103

What data type is enum?

924

What is complexity of bubble sort?

891

Which is better hashmap or arraylist?

1015

Write an algorithm through which the inserting and deleting of elements can take place in circular queue?

1179

How does a hashmap work?

943

Can we create a null as a key for a map collection?

931