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

Is treeset sorted?

964

What is array simple?

934

List the area of applications of data structure.

1206

Can hashtable have duplicate values?

918

What are the advantages of stack?

859

What is a matrix?

1085

How do you find the height of a binary tree?

896

Write the steps involved in the insertion and deletion of an element in the stack.

1347

Why is hashing used?

867

Write a recursive c function to calculate the height of a binary tree.

910

Can you make an arraylist of arrays?

1096

Write any two principles of gradation of structures.

989

How to get the index of an array element?

1058

Explain implementation of traversal of a binary tree.

1063

Does treeset remove duplicates?

935