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

Is linked list faster than array?

846

What is ordered map?

848

Why do we use trees in data structures?

899

Is hashmap a data structure?

998

Define a right-skewed binary tree?

933

Which sorting has less time complexity?

921

Describe the degree term in a tree.

954

What is impact of signed numbers on the memory using data structures?

1036

What thread means?

891

Explain how is linked list implemented?

936

What is a matrix? Explain its uses with an example

1150

What is arrays copyof?

869

Write an algorithm to show the reverse of link list?

858

Which interfaces are implemented by concurrentskiplistset?

856

What is an example of an array?

1045