3.5 Infix to Postfix Conversion Rules using Stack | Data structures Tutorials

In this video, I have explained the conversion of INFIX expression to POSTFIX expression using STACK. Keeping in mind the priority of operators(precedence) as well as associativity of operators. Associativity comes into picture when two operators of the same precedence arrive like addition and subtraction, multiplication and division etc.

******************************************

More Playlists:

********************************************

Connect & Contact Me:

#infixtopostfix #jennyslectures #datastructures

[rajatnaskar]

Kaise mujhe tum mil gayi,
Kismat pe aaye na yakeen!!!

You are the best D.S teacher. Thanks a lot.

[sansurvives]

Thank Youtube for recommending this channel to me! Got addicted to your lectures.

[trimbakrajitkar]

3000 Thounds times more respect to your great efforts 😊

[HarshPatel-kock]

My left ear feels educated now :) when plugged in earphones 🙄

[sonkarshailendra]

The way of teaching and explaining the topic is really great as you take from basic to deep in easy way. I really appreciate your efforts. Thanks a lot.

[Harshp]

1:21 if anyone want to save these golden rules/steps for infix to postfix using stack as a screenshot. (all the rules are visible at this time point 😊)


Only rare videos force me to comment. this is one of them. absolutely wonderful explanation.

my doubt was of "what to do if imcoming operator will have same precedence as top?"

is now cleared with your point No.7 which is explained on top right side of board

if their associativity rule is of:
L to R: firstly pop & print the top of stack and then push the incoming operator.
R to L: push the incoming operator.

Thanks a lot dear teacher. 😘

[Tonystark-cdvw]

Finally i found this channel's first video 😊

[ayushsamra]

when u said // Stack aap sabko pta hai in hindi was very peaceful to hear from you
As you always speaks in English ❤😇😍

[CitizenWarwick]

Jenny I could listen to this all day every second I am learning something new from your lectures. I never thought I could deal with this level of computer science though now I feel way more confident tackling expression tree parsing and writing my own parsers, thanks! 🙏

[shinebaka]

You have come a long way good to see your progress and dedication of making these videos.

[hasiburrahman]

Best online lecture ever I have seen. Love and respect form Bangladesh...

[kithenry]

evident how much effort she puts into making these🙂

[mohitshaw]

Hindi😍
Love the way to made us understand datastructures
For me before it was like so hard to learn then i started with your video and my thinking changed Thank you so much❤️

[parveenbhullar]

teaching method is very simple, English bhi bahut simple hai, aasani se samajh aa jati hai, thank you mam🙏

[godhaninisarg]

Thank you so much you are the best teacher of DSA . No one can match you . every student can understand your lectures . Thank you ma'am

[jerwinsamuel]

Great video. You're an awesome teacher. Even though I couldn't understand some hindi bits, I understood what you meant. Please do keep making more videos and ignore the harsh comments. You definitely helped me out with your videos. Have a good day.

[jamesroy]

This is best video in visuals every letter is clear and no highlight reflection

[malar]

Mam u really rock because i understood all the topics u taught. upload more videos for dec.2019 net exam. i am very eager to learn from u. thanku so much

[hashcodez]

thank you so much for your efforts ma'am!!
looking more beautiful in dim lighting

[AtifKhan-tftg]

Really good teacher❤❤
The way of conversion from english to hindi is really amazing😁.
great explaination