Interested to Buy Any Domain ? << Click Here >> for more details...
Convert following infix expression to the prefix expression.
a - b + c * (d / e - (f + g))
- 33 Answers
- 61486 Views
- Amazon, Microsoft, Star Technologies, Sun Microsystems, Wipro, I also Faced
- E-Mail Answers
Answer Posted / bipin fro uu mca
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 ? | 8 Yes | 2 No |
Post New Answer View All Answers
Please Help Members By Posting Answers For Below Questions
What is ascii sort order?
Define an equivalence relation?
Explain merge sort algorithms.
What is the capacity of arraylist?
What is stable sort?
What do you mean by sorting data?
Explain pre-order and in-order tree traversal.
What is meant by binary tree?
What is an expression tree?
What is time and space complexity of bubble sort?
What is ascending and descending order?
Define back edge?
Why is quicksort better than mergesort?
What do you mean by 2-3-4 tree?
What is bubble sort algorithm?
