Convert following infix expression to the prefix expression.
a - b + c * (d / e - (f + g))
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 |
Post New Answer View All Answers
What is an expression tree?
Why do we use dynamic arrays?
What is heap with example?
How many types of sorting algorithms are there?
What do you mean by heap order property?
Can arraylist store primitives?
What are the five examples of data?
What is the prerequisite for binary searching?
Differentiate between an array and an arraylist.
What are the differences between b tree and b+ tree?
Where the data structures are used?
How do you sort elements in an arraylist?
Which sorting algorithm is used in arrays sort?
Define ancestor and descendant ?
For addition and deletion. Which one is most preferred: array list or linked list?