Interested to Buy Any Domain ? << Click Here >> for more details...
Convert following infix expression to the prefix expression.
a - b + c * (d / e - (f + g))
- 33 Answers
- 59248 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 difference between data type and data structure?
Why concurrenthashmap is fail safe?
What is unbounded queue?
Why it is important to have aligned addresses? What is the exception generated when there is a misaligned address?
What is the need of sorting?
Why do we use data structures?
How does a binary search work?
Can we change the size of an array at run time?
What do you mean by open addressing?
Differentiate between singly and doubly linked lists?
What is array define its types?
Can we declare array size as a negative number?
What is the difference between file structure and storage structure?
What is the difference between 1d and 2d array?
If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?
