Convert following infix expression to the prefix expression.
a - b + c * (d / e - (f + g))
- 33 Answers
- 51888 Views
- Amazon, Microsoft, Star Technologies, Sun Microsystems, Wipro, I also Faced
- E-Mail Answers
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
Is arraylist synchronized?
What are the four characteristics of algorithms?
Are hash tables ordered?
Explain circular linked list?
Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
What are threaded binary trees?
What is sort in data structure?
What are splay trees?
How will you explain circular linked list?
Explain binary searching and Fibinocci search?
Why do we need sorting algorithms?
Can tuple be sorted?
What are the disadvantages of linear list?
What is meant by binary tree traversal?
What are the drawbacks of array implementation of queue?
