C++ PROGRAM to Convert Infix to Postfix Expression using STACK Data Structure (With Full Code) | DSA

Support Simple Snippets by Donations -
--------------------------------------------------------------------------------------------- In this tutorial, we will study write a C++ program to convert infix to postfix expression using stack data structure. We will take the pesudocode from the previous tutorial and convert it into a C++ program.
You can use any other programming language too because the pseudocode will remain the same.
Understanding pseudocode is very important to write code to implement infix to postfix using any programming language.

Simple Snippets Official Website -
Simple Snippets on Facebook -
Simple Snippets on Instagram -
Simple Snippets on Twitter -
Simple Snippets Google Plus Page -
Simple Snippets email ID -

#infixprefixpostfix #stackdatastructure #datastructures #stack #dsa #infixtopostix

[khansaarshad]

This video proved to be extremely helpful to me.. Thank you so much.. More power to you

[TehamSaeed]

The link of this video was provided in our university’s presentation lecture. We were guided to have an understanding of Infix to Postfix and Infix to Prefix Conversion. That’s how I got this video. You did a great job in easy and understandable way that your video is suggested at university level. Applause for your work. Thankful to Youtube as well to be the platform of quality educational videos.

[vijaybhame]

One of the best video explanation I have ever watched.
Really helpful.

[yourbestie]

advertisement - learning data structure and algorithm is difficult
tanmay : hold my beer😂😂

[Pages_Perfected]

First you explain better than some people
Second my professor don't want to help me code this he is saying it is your own work
He just explain the idea and I should write the code
Well, I'm learning that's why you should help me
Maybe I'm wrong, maybe

[kirigiri_vietnam]

OH MY GOD! THANK YOU SIR ! THERE IS NO WORD TO DESCRIBE MY HAPPINESS WHEN I FOUND THIS CHANNEL xD. and they say watching youtube everyday wont get me anywhere

[culturapoliticaycomputador]

Thank you so much mr. its an excellente code for learn something about postfix expressions.
I see you web and is awesome!!

[SaumyaSharma]

Thanks a ton am eagerly waiting to write
It takes lot of efforts to make such types of content 🔥🔥🔥🔥🔥👌
Finally code executed.... Credit goes to u bro👍👌

[someshpundir]

The best guy. The best tutor. The best. Best best

[aishahibrahim]

this video help me so much in my assignment thank you so much

[saipavankumark]

bhai lots of thankyou
I am watching your videos from starting, you are only the one who can understand students pain
And your are teaching end to end #making skillest
YOU MADE ME ZERO TO HERO IN PROGRAMMING
proud of u bhai



peace

[samarthnaik]

Thanks a lot bro 🙏🙏
It was of great help.... 🙏

[yasirmumtaz]

UNDERSTOOD BOSS THANKS ALOT OF SUCH AN EFFORT FOR US REGARDLESS OF ANY REWARD.

[mwajahat]

Thanks for guidance. Moreover, please also update, If expression contains any digit or numerical value, as currently this program not work for it...!

[funlifeu]

A very helpful lecture i found ✌God bless you Sir😄

[cjeeckazad]

I just say you are amazing bro! really amazing

[TheGuitarpro]

Thank you for the help!
What if we want to put spaces between each operand and operator? How do we do that?

Example: 5 + 6 * 3 <-- spaces
Example: 5+6*3 <--no spaces

[mubashirrahim]

I have a question. If an expression contains integer along side variables. Then how to store that integer.
E.g A=B=4.

[dheepakraaj]

Bro I have one doubt if precedence is equal say for (eg:consider + is in top and - is incoming)then we need to pop the top of the stack(+) and whether we need to push( -)or we need to check with new top ??

[anilrao]

Can you make video without using stack and using pop and push functions