Problem Statement :
Convert Infix expression to Postfix Expression.
Solution :
Algorithm :
1. If the character is operand, append in the Output Result.
2. If you get openings bracket '(', push into the stack.
3. If you get closing bracket ')', pop all element from the stack until you reach '(' and add in the Output Result.
4. If the character is operator
a. if the stack is empty, then push operator to stack.
b. Else, Pop all the operators from the stack which have greater than or equal
precedence than that of the current operator.
After doing that Push the scanned operator to the stack.
Below is the implementation of the above algorithm.
Please post your comments and suggestions.
Happy Coding !! :)
Convert Infix expression to Postfix Expression.
Input : a+b*(c^d-e)^(f+g*h)-i
Output: abcd^e-fgh*+^*+i
Solution :
Algorithm :
1. If the character is operand, append in the Output Result.
2. If you get openings bracket '(', push into the stack.
3. If you get closing bracket ')', pop all element from the stack until you reach '(' and add in the Output Result.
4. If the character is operator
a. if the stack is empty, then push operator to stack.
b. Else, Pop all the operators from the stack which have greater than or equal
precedence than that of the current operator.
After doing that Push the scanned operator to the stack.
Below is the implementation of the above algorithm.
Happy Coding !! :)
No comments:
Post a Comment