Convert following infix expression to the prefix expression.
a - b + c * (d / e - (f + g))
Answer Posted / bipin from utkal university mc
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 (final answer)
| Is This Answer Correct ? | 34 Yes | 5 No |
Post New Answer View All Answers
What is the best case complexity of bubble sort?
Define quadratic probing?
What is lifo?
Can you sort a hashmap?
What are the objectives of studying data structures?
Which language is best for learning data structures and algorithms?
How do you sort a map by key?
What are the complexity of binary search?
What actions are performed when a function is called?
Can a class have a constructor?
List out the applications of a linked list?
Complete structure of hashmap, very detail description, along with the basic coding of the hashmap internal implementation.
What is meant by int?
What is selection sort with example?
How does insertion sort works?