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

How will you free the memory that is allocated at run time?

950

Can array store heterogeneous data?

798

How does a hashtable work?

850

Define splay tree?

931

How do you do binary search?

845

Explain linear linked implementation of Stack and Queue?

1028

What is difference between list and set?

801

List the types of rotations available in splay tree?

1123

Explain the uses of binary tree.

885

Differentiate bfs and dfs?

972

Which is the simplest file structure?

977

What is the best case time complexity of bubble sort?

996

What is hashing in cyber security?

864

Define non-linear data structures?

999

Can treeset contain null?

851