Postfix To Infix How To Convert Infix
After reversing A+B*C will become C*B+A. And before pop, we’ll print every operators.When the traversal will finished, we’ll continue to pop top of the stack until it's empty, and before pop we’ll print every operators.To convert an infix to Prefix, first we’ve to know how to convert Infix to postfix notation.Initially we’ve a string S which represent the expression in infix format.Reverse the string S. Before that we’ll pop top of the Stack. We’ll stop searching until it’s empty or we’ve found one. We’ll continue to pop top of the stack until we find that S is greater than the top of the Stack (by the rules of precedence) Ex: if we found an Multiplication operator on S We’ll continue searching for addition or subtraction operator on top of the stack. Before we pop top of the stack, we’ll print every character of top of the stack except ‘)’.If we encounter an operator, we’ll take the following actions:
...
0 kommentar(er)
