Write the equivalent infix expression for the followingpostfix expression a b -

Question

Write the equivalent infix expression for the followingpostfix expression a b - c - d * Write a pseudo code of convert the postfix expresson to infixexpression. What is the complexity of this algorithm? Could you please mention each and every step. Thank you Write the equivalent infix expression for the followingpostfix expression a b - c - d * Write a pseudo code of convert the postfix expresson to infixexpression. What is the complexity of this algorithm? Could you please mention each and every step. Thank you

Explanation / Answer

a b - c - d * steps. STACK (input a): a STACK (input b): a b STACK (input -): (a-b) STACK (input c): (a-b) c STACK (input +): ((a-b) + c) STACK (input d): ((a-b) + c) d STACK (input *): (((a-b) + c) * d) infix notation will be (((a-b)-c)*d) algorithm: STEP 1.   scan the postfix expression until end. STEP 2. If input is operand then push it on stack. STEP 3. If input is operator , then pop to symbol from stack andmake the infix as (s1 O s2) now push this node as single node onstack. where s1,s2 are operand O, is the operator STEP 4. When input end occur, the stack content will be infixnotation.

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.