Convert following infix expression to the prefix expression.
a - b + c * (d / e - (f + g))
- 33 Answers
- 51681 Views
- Amazon, Microsoft, Star Technologies, Sun Microsystems, Wipro, I also Faced
- E-Mail Answers
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
How is any data structure application is classified among files?
What happens in insertion sort?
Explain about map and their types?
Describe the height term in a tree.
Can we add elements to final list?
What is array sort?
Describe the types of data structures?
How would you dynamically allocate a one-dimensional and two-dimensional array of integers?
How would you swap the Kth node from beginning with Kth node from end in a Linked List.
Complete structure of hashmap, very detail description, along with the basic coding of the hashmap internal implementation.
Explain the uses of b+ tree.
What is heap tree in data structure?
What is meant by a dynamic array?
Is arraylist a collection?
Define balancing condition for AVL Tree.
