×
Home Discussions Write at Opengenus IQ
×
  • DSA Cheatsheet
  • About
  • One Liner
  • RANDOM
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓

infix expression

A collection of 2 posts

Algorithms

Converting Postfix to Infix using Stack

We have explored an algorithm to convert a Postfix expression to Infix expression using Stack. This takes linear time O(N)

Akshay Gopani Akshay Gopani
Algorithms

Conversion of Infix to Postfix Expression using Stack

To convert Infix expression to Postfix expression, we will use the stack data structure. By scanning the infix expression from left to right,if we get any operand, simply add it to the postfix form, and for the operator and parenthesis, add them in the stack maintaining the precedence of them.

Piyush Rajendra Chaudhari Piyush Rajendra Chaudhari
OpenGenus IQ © 2026 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter