(a * b+ c ^ d) * (e -f / g*h). Infix expression to post fix expression
Answers
Answered by
0
Answer:
Stack is used to convert an infix expression into postfix/prefix form. ... Postfix to Infix Conversion Algorithm of Postfix to Infix Expression = abc-+de-fg-h+/* 1. ... example a*b-c/d is the infix expression, and equivalent postfix expression is: ab* cd/-. ... only couple of changes, we would have suggested. '+' For addition 2. g. For e.
Similar questions