Rules to Convert Infix to Postfix Expression using STACK Data Structure (With Solved Examples) | DSA
ฝัง
- เผยแพร่เมื่อ 23 ก.พ. 2020
- Support Simple Snippets by Donations -
Google Pay UPI ID - tanmaysakpal11@okicici
PayPal - paypal.me/tanmaysakpal11
--------------------------------------------------------------------------------------------- Learn how to convert infix to postfix expression using stack datastructure using a set of rules. In this tutorial we will study and understand the rules as well as the working of stack ds in this infix to postfix conversion. One of the application of stack data structure is to convert infix to postfix expression because of its properties and mode of operation that is Last In First Out (LIFO) or First In Last Out (FILO)
We will solve 2 examples where we will convert infix to postfix using both manual method and stack ds and compare the results.
Theory & Code article - simplesnippets.tech/infix-to-...
Full DSA playlist - • Introduction to Data S...
C++ Programming Tutorials for Beginners Course - • Introduction to Comput...
Simple Snippets Official Website -
simplesnippets.tech/
Simple Snippets on Facebook -
/ simplesnippets
Simple Snippets on Instagram -
/ simplesnippets
Simple Snippets on Twitter -
/ simplesnippet
Simple Snippets Google Plus Page -
plus.google.com/+SimpleSnippets
Simple Snippets email ID -
simplesnippetsinfo@gmail.com
For More Technology News, Latest Updates and Blog articles visit our Official Website - simplesnippets.tech/
#infixprefixpostfix #stackdatastructure #datastructures #stack #dsa #infixtopostix
I pay 34k pkr to my uni per semester yet I always come back here to study rather than watch online class lecture recordings of my uni, its funny how so few people actually know how much of a necessity it is to teach with love, hard work and proper explanation and attention. I'm literally learning something here that costs me a good amount of money at another place. Words cannot describe how grateful I am to have found your channel Sir. You're one of those teachers that one gets to see teaching others, once a lifetime. You have taught me how to code and after 14 years I have found something that I enjoy studying(I hate studies lmao). Thank you for what you do, know that it is creating an impact way bigger than you think.
Wow this comment really made my day buddy. I'm very happy that my videos have helped you and given knowledge to you 😊
On the sarcastic note - Please transfer that 34K amount to my account 😂😜😂 kidding 😉
Keep learning & if you want to support me please do share my videos & channel with your friends too. That's the biggest help you can provide 😊👍
@@SimpleSnippets on a serious note🤣 I wish I could but one day I will as a way of saying thank you.
@@SimpleSnippets you dont know but your channel have saved so many lives😄. thanks for existing
this is the best explanation in stack i ever sew, even more clear than my prof
All hail the GOD of data structures and algorithms...
TANMAY SAKPAL 🙏🙏🙏💙💯
🙌🙌🙌🙌❤️❤️❤️❤️
These data structure lessons are a lifesaver, thank you.
Glad it was helpful!
@@SimpleSnippets Can u please solve this
a+b^c*d+e to postfix using stack and explanation
The efforts which you put up into the video clearly show up!!!!! Thanks!
So nice of you
Thank you so much for taking such great efforts for the explanations!
Amazing video bro, helped me so much more than my professors 4 and 1/2 hour lectures! keep it up
Glad it helped! Keep up the support by sharing the videos with your friends too! 😇
This video is the best tutorial on converting infix to postfix notations that I have ever found. Thank you for making this video!!
thank you sir...I never understand this concept before but the way you define the rules and relate the example...makes the concept very simple and easy... now i easily convert my all expression...thank you once again
Superb ....cleared all my doubts 🔥🔥 thanks a lot 🙏
Thank you Tanmay sir,, for all this awesome playlist!!
It was perfect to understand thank you ☺️
Perfect !!!
Thanks for your contribution
best video on this tricky question
Amazing video 💞 it helped me so muchh thnx boss
thank you bhaiya💯
You r a greate teacher
Thank you so much!!!
Thank you so much
Superb bro 🙏
Amazing , Thank you so much !!
You are welcome!
I really enjoy this concept 😍
That's really nice to know Anjani ✌️
nice videos i wish u have more videos since i have exam tomorrow hehe u clear the concept nicely
Thanks buddy, more videos coming soon. These videos will be helpful for you even after your exams for sure ✌
Thanks alott you are a life saver
Happy to help bro! Please support me by subscribing & sharing our channel with your friends ✌
Love from nalgonda ❣️
awesome video
Thank you buddy, glad to hear this from you. Please do share the videos with your friends too 😇
@@SimpleSnippets Can u please solve this
a+b^c*d+e to postfix using stack and explanation
you are amazing bro
Thanks bro, please do share the videos & our channel with your friends too. Thats the biggest help and support you can give back to this channel! 😇
Bro you are best😀
Thats really great to know Puneet🙏 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
thanks a lot bro
Most welcome buddy, glad to hear this from you. Please do share the videos with your friends too 😇
Boss you deserve much more followers 👏 🙌
Thank you so much bud, please keep sharing the videos with your friends too. Thats the biggest support you can provide!
👍👍
Thank you
You're welcome
you ARE THE LAST HOPE HERE BO.......I PAY 65K PER SEMESTER BUT THEY ARE UNABLE TO MA MAKE LEARN A SINGLE CONCEPT.......WHENEVER I FIND MYSELF UNABLE TO UNDERSTAND SOMETHING ABOUT CODING I COME TO YOUR CHANNEL
But, what if the expression is ( A + B - C * D / E )? The logic will wrongly evaluate it to (A B + C D * E / -)?
What I noticed is that , while using the associativity rules its simply wrong to pop the top of the stack, if associativity is from left to right, because if we pop and print we are assuming that the operators that come after this current operator have lower precedence.
For Eg: A+B-C cant be evaluated as AB+C- as the whole expression maybe A+B-C+D or A+B-C*D. If we have * coming after - we need to postfix that first. And, for this to happen we need to scan whats coming after it.
Bro i have a question, Why we need to use BODMAS rule ?
How do you deal with negative numbers?
I like your videos bro
Thank you so much buddy. It would mean a lot if you could please share our channel and videos with your friends too ✌
Infix to postfix a+b*c-d+e/f
Answer= abc*+-def/+
Is this crt bro
noice :)
sir, which software do you use for blackboard presentation
Its called Smoothdraw4
Best best best 😁😁😁
Thank you so much buddy🙏 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
@@SimpleSnippets Can u please solve this
a+b^c*d+e to postfix using stack and explanation
Thanks man.
Most welcome Adeel ✌
@@SimpleSnippets Can u please solve this
a+b^c*d+e to postfix using stack and explanation
12:32
What if we have top and upcoming operator same?
How would that be possible?
@@SimpleSnippets Like in first example you gave, we got '+' and '-' then we applied associativity rule. What if inplace of '-' we have got again '+'? We have to pop out. Right?