Convert following infix expression to the prefix expression.
a - b + c * (d / e - (f + g))
Answer Posted / piyush kumar
a-b+c*(d/e-(f+g))
=a-b+c*(/de-(+fg))
=a-b+c*(T-S) where T=/de,S=+fg
=a-b+c*-(TS)
=-ab+c*-(TS)
=-ab+c*V where V=-TS
=X+Y where X=-ab,c*V=Y
=+XY
=+-abc*V
=+-abc*-TS
=+-abc*-/de+fg
| Is This Answer Correct ? | 3 Yes | 16 No |
Post New Answer View All Answers
Mention some drawbacks of the linked list.
What is mean by abstract data type?
Is char array null terminated?
What does it mean to sort an array?
Write any two principles of gradation of structures.
What is the Insertion Sort Code?.
What do you mean by recursive definition?
Can you override methods of arraylist?
What is the use of heap sort?
Define probing?
How expression trees are gets represented in data structure?
Give the example of validating the parenthesis of expression using stack.
Is sorting a math skill?
Explain the term run-time stack?
How to reverse singly link list?