Infix to Postfix Conversion Algorithm Part 1 | Data Structure Using C

TL;DR

This video explains the algorithm to convert infix expressions to postfix expressions using a stack and operator priorities.

Transcript

hello dear students i am samir velankar i welcome all of you to this another video on expression evaluation in this video we will be seeing how to convert infix expression to postfix expression well you already know that in the very first video of this series we saw how to convert any infix to postfix but we will be learning computer algorithm to c... Read More

Key Insights

• 😑 The algorithm converts infix expressions to postfix expressions using a stack and operator priorities.
• 🤬 A special symbol like tilde is added to the stack to facilitate correct operator placement.
• 🍵 The algorithm handles brackets by solving them first and converting any operators within them to postfix.
• 📲 Incoming priorities and in-stack priorities are used to determine operator placement on the stack.

Summary & Key Takeaways

• The video introduces the concept of converting infix expressions to postfix expressions using an algorithm.

• It explains how the algorithm uses a stack and operator priorities to convert the expressions.

• The video provides step-by-step instructions on how to convert an example infix expression to postfix.