Infix to Postfix using stack

duude such a great clear explanation, still helpfull 9 years later, thanks a lot 👍

Talk to only point of view no bakwasssssd

YOU ARE THE BEST. THANK YOU :)

Best explanation ever STILL 🙏🙏🙏

12 may 2022

Why we do an extra pop in else if closing parentheses?

24/03/22 and it still saved me

thnx for uploading such video. very helpful

these videos are GOAT on data structures

This lesson is going to live forever helping future students! Thanks.

Best video for explanation :)

Can't we use recursion for the stuff inside paranthesis?

I'm watching this before the exam.

bro you are god!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

hi

2014 Passed out, still remembered

214 ppl dont know their basic programming rules

boring way to teach

OMG! Thank you sooo much!

You are doing the Lord's work, even in 2021

Can't be better

R.I.P! Your videos will survive

Such a quality content!!! ❤️... Undoubtedly it deserves more views and likes!

Psuedo code is totally different from my school teaching material, so i only watch the logic part .

Just mingblowing!
Wow!

this video was uploaded on 2013 but still in 2020 this is the best explanation

Who's still watching this masterpiece in 2020?

How someone can dislike these gem videos

Just to note, combining this lesson with the previous lesson you can make a working calculator.

simple and outstanding ,cant have better videos on infix and postfix than this.

I understand what to do with my project now. Thank you for explaining it well!

A+b+c+d=?

What about exponents?

Thank you

Thank you! I really understand this now!

Thanks bro

while(1)
{
respect++;
}

Really Good

This is Dijkstra's shunting-yard algorithm.

Hey thanks for saving my grade- A dumb CS student

why should we iterate only till n-1 ? We didn't use any exp[i+1] in the psudeo code. Then why???

You are my hero! :)