Convert following infix expression to the prefix expression.
a - b + c * (d / e - (f + g))
- 33 Answers
- 55729 Views
- Amazon, Microsoft, Star Technologies, Sun Microsystems, Wipro, I also Faced
- E-Mail Answers
Answer Posted / ashish
Algorithm for Infix to Prefix Conversion is
1. Reverse the given expression ...
2. Apply algorithm of infix to post-fix conversion...
3. Again reverse the expression after the post-fix conversion...
Infix Expression is => a - b + c * (d / e - (f + g))
step 1: => ( g + f ) - e / d ) * c + b- a
step 2: => apply post-fix ...
( ( g f + ) - e d / ) * c + b - a
( g f + e d / - ) * c + b - a
g f + e d / - c * + b - a
g f + e d / - c * b + - a
g f + e d / - c * b + a -
step 3: => final step reverse the expression ...
Prefix Expression = - a + b * c - / d e + f g
...
source :: http://scanftree.com/Data_Structure/infix-to-prefix
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
Is there any difference between int[] a and int a[]?
Do you know how to find if linked list has loop?
What are types of Collision Resolution Techniques and the methods used in each of the types?
What is a tech stack?
What is red black tree in data structure?
How do you sort a map by key?
How would you use bsearch() function to search a name stored in array of pointers to string?
What is difference between while and do while?
What does the term sorting refer to?
What is map keyset?
Does arraylist have a tostring?
Which is faster array or list?
What is a singletonlist?
What are data and data types?
Explain Array
