Convert following infix expression to the prefix expression.
a - b + c * (d / e - (f + g))
Answer Posted / tadveer verma
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 ? | 13 Yes | 2 No |
Post New Answer View All Answers
Why do we study data structures?
Can we define the size of arraylist?
Give a basic algorithm for searching a binary search tree?
What is the use of isEmpty() member methods?
Which sorting technique is best in worst case?
Why do we need arrays if all the operations that are performed on arrays can be performed on arraylist?
Define a binary search tree?
Explain quick sort?
Is map a collection?
Which list does not allow duplicates?
Is heap sort adaptive?
What data structure underlies a python list?
Define b-tree of order m?
How many sorting are there in data structure?
What is linear-logarithm chasm?