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 can a binary tree be represented using the rotation?

970

How will you reverse Linked List.

946

What is unbounded queue?

976

What is an algorithm in coding?

920

What are the operations that can be performed on a stack?

963

What is unhashable type list?

902

What is the top of a stack?

1045

Can we modify final arraylist?

1105

Define in brief an array.

994

Which sorting is best?

958

Why we need cursor implementation of linked lists?

1057

Where will be the free node available while inserting a new node in a linked list?

985

Is complete binary tree?

966

Which interfaces are implemented by printerstatereasons?

959

What is dynamic array how it is created?

973