Convert following infix expression to the prefix expression.
a - b + c * (d / e - (f + g))
- 33 Answers
- 51637 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
What is the difference between linked list and array?
Can we insert null in list?
Differentiate among cycle, path, and circuit?
What is sorting with example?
Differentiate linear from non linear data structure?
What are the major data structures used in the hierarchical data model?
What is difference between concurrenthashmap and hashtable?
What is a reverse linked list.
Explain what are the notations used in evaluation of arithmetic expressions using prefix and postfix forms?
Why hashmap is faster than hashset?
Which sorting is used in collections sort?
How long does it take to master data structures and algorithms?
Explain the applications of stack?
What are the advantages of stack?
Can we sort hashmap?
