3.8 Infix to Prefix using Stack | Data Structures Tutorials
ฝัง
- เผยแพร่เมื่อ 3 ต.ค. 2024
- Jennys Lectures DSA with Java Course Enrollment link: www.jennyslect...
In this lecture, I have described an efficient algorithm for infix to prefix conversion using stack in data structure. Also discussed infix to prefix conversion without stack with example and analyzed both the approaches.
DSA Full Course: https: • Data Structures and Al...
******************************************
See Complete Playlists:
C Programming Course: • Programming in C
C++ Programming: • C++ Complete Course
Python Full Course: • Python - Basic to Advance
Printing Pattern in C: • Printing Pattern Progr...
DAA Course: • Design and Analysis of...
Placement Series: • Placements Series
Dynamic Programming: • Dynamic Programming
Operating Systems: // • Operating Systems
DBMS: • DBMS (Database Managem...
*********************************************
Connect & Contact Me:
Facebook: / jennys-lectures-csit-n...
Quora: www.quora.com/...
Instagram: / jayantikhatrilamba
#stack #infixtopostfix #jennyslectures
*I am always feeling bored while watching tutorials online but your style of delivering lecture is somehow different. Thanks Ma'am and keep continue. I think that i am not the one who fall in love with your lectures.*
i feel the same! her 20 min lecture can be finished in 10 mins too!
Yeah, you're right. But tell me how do you make your comment text bold?
@@nazansari9902 * (your text) * remove space b/w asterisks
@@Arsh-kd4cq *thank you*
@@Arsh-kd4cq *I got it*
BRUH this video actually saved me for my coding assignment (use a stack to convert an infix string to prefix). ALL the coding websites claim that all you have to do is reverse the string, then do the usual infix to postfix conversion, then reverse the resulting string. What they DON'T tell you is that you do NOT pop operators of the SAME priority. All it took was a quick skim through your video to figure out what had gone wrong. Thanks Jenny!
India strongly needs teachers like u mam. Harry bhai , Khan sir , Jenny mam, and soo on. We are blessed that u all are born in India ❤️❤️
Mam, Really No doubt you are a good teacher.
Who told then she is bad teacher 😒 😂😂
Thanks mam for saving our time and money ...I prefer all of my friends to watch your videoes ..you are the only one who care about us
dear sister,
you have explained each and everything in a perfect way, earlier I was having a lot's of doubt in "infix in prefix" but you cleared.
You are the excellent teacher of Data Structure.
Thank you so much to make a video on this topic.
Nikal l
First of all a great great thanks to dear Jenny Teacher.
I salute her for teaching such a tough topic of DSA in very simple and easy manner.
When I was in class 6th I use to think how to solve a math expression in Java and C .
Then when I learnt the INFIX prefix and postfix then I coded my own mathematical Calculation Program in C++.
Thanks once again mam for your great help by teaching.
I salute you mam
⭐⭐⭐⭐⭐
Thanks **100000000... Times thank you
wow it is so clear explanation. i hope you keep making new videos. you saved me !!!!
Mam ur teaching skills are really very good. I understood each and every topics that u taught. Keep it up👍
Q
Thank you so much ma'am 😊
I found it very helpful
I was confused when it was thought in my class (online classes) but after watching this video all of my doubts got cleared
@Sagar . tharki saala 🤣🤣🤣
World best teacher 🎉❤ very thankful to you madam our college was do this data structure in just 3 days we won't understand now there will be an exam your videos are very helpful to me thank you so much madam 🎉
you are the gem....i was not aware of associativity so was getting wrong answer ... now it is clear..thank you very much
Speechless , what's the explaination, heads off to u ma'am!
Thnkuuu dii for making this video ... seriously Ur way of teaching is sooo attractive which is easily understandable
But I can't understand
After watching your video of conversion of infix to postfix I was able to write the code on my own using your algorithm.....
Thanks and present mam😊🙋🏻♂️
AAYUSH PAGARE hey can you please send me the code if you still have it !! Thank you
Thank you ma'am!🔥this is the first clip for clearing my doubts for infix conversion🔥👍🏻
I can't thank you enough ma'am I was struggling with this prefix thing very bad.... Thanks a ton
I have exams in 10 days. I did not understand anything when my clg faculty was teaching....but now after watching your videos data structures has become my favourite subject. Thank you so much ma'am.
You are the best teacher I have listened to
Mam you teach very well, I could not understand anything in this subject but when I took your lecture, my doubts were cleared thank you mam.
And you are doing great job , i have become your fan from when i saw your first lecture, which was about patterns of C language. Keep going on.
soon ur going to dominate other CS channels if u continued making more videos...keep it up
Ma'am you have not written 'U' in the final prefix expression..you have explained very well.. thankyou
Thanks mam. Minor mistake in d stack conversion to prefix. It left out the U after reversing but it's ok. You are super excellent mam. You have saved my life for good
Mam,you are a magician because you fill concept in our mind in only a video ❤️
I think after watching this video there is no doubt for any student like me on this important topic.
thanks for your contributions. i love you Ma'am. keep continue with your hard work, and you are helping me a lot. God bless you.
Ma'am It seems like data structures is more easier than class 8 maths for me ..The way u are explaining the concepts is just awesome...
Thank you ma'am for this, Tomorrow is my DSA exam, thank you for the last minute preparation
US BRO US
Mam,you make my life so easy in data structures
Thanks a lot mam..... ❣️♥️♥️
MAM YOU ARE THE BEST TEACHER OF MINE YOU MADE MY LIFE EASIER
thank you for helping me. I followed your many videos. God BLESS YOU.
Your teaching way is superb.. I understand easily
Mam ap hamare valmiki guru ho
Apke lecture dekh k me dsa topper ho gaya
at 13:52 you missed "U" in the expression. Anyways nice explanation ma'am!
Mam, these lectures are best! I was feared of this topic. But you have made it very easy. Thanks a lot
MA'AM IT'S SPLENDID!! THANK YOU SO MUCH
Ma'am, in your previous lectures you had taught that if both the incoming and the 'top-of-the-stack' operators have the same precedence and thereafter associativity of 'Left-right', then we need to pop the top of the stack before storing the incoming operator. But here in the 8th step, you pushed the incoming operator instead.
that should be the infix to postfix case because in the prefix case you are scanning the string reversely which leads to reversed associativities rules
@@dominicpeng8802 So I'm actually wondering the samething. Other guides say that we should follow the postfix style operator associativity rules since we already reversed the expression.
what if right to left associativity in case of infix to prefix
Guys, basically if you're just doing infix->postfix you just loop the condition
while (precedence(operator) top)
pop
finally push
if doing infix->prefix, reverse the string and then do the same process as postfixing but instead the condition for operators is
while (precedence(operator) < precedence(operator at stack->top)
pop
finally push
(At the end reverse again)
Hope this helped
Thanks My Lovley Teacher For Your Great Contribution To develop My Attitude In DS!!!!!!
Amazing video with such a simple and articulate explanation... Keep it up ma'am! 💯
Mam while explaning please give synonyms for prefix , postfix, and infix like for post fix reverse polish.When anyone see a new name they think that they don't know the concept.In exam they will use synonyms mostly.
Mam, your teaching style is amazing
thank you so much ma'am had data structure exams and will your help I was able to pass 20 marks for one question
Thank you very much. You are a genius. 👍👍🔝🔝👌👌
thank u so much ma'am i really like ur way of teaching and finally understood both of the conversations; infix to postfix and prefix
Ma'am aap ki way of teaching bahut acchi hai please aur bhi subjects le ke aaiye .... For ugc net exam
Ma'am in flow you do one mistake in the final result of prefix you miss the U element
Thanks maam you are a good teacher.
A small mistake ma'am in this video. After getting final answer using algorithm you forgot to write "U" i.e. in the end it will be "OPWUVTQ" but you have written"OPWVTQ".It's somewhere between 13:00 - 15:00
Yeah bro that was a mistake
Ma'am prefix for this infix expression" K+L-M*N+(O^P)*W/U/V*T+Q " will be "+K-L+*MN+*^OP/W/U*VTQ "..... not that what you taught.........pls let me know if I am wrong....
but javaTutorialPoint says the same as mam said whereas some online converters are giving the ans you said
Mam , you are a really good teacher
Mam I love your teaching style
You are best teacher forever 👍👍
Wish u all success n happiness in life mam
MADAM JI , I REALLY LIKE THE WAY YOU TEACH US ALL AND THE CONTENT IS JUST AMAZING HATS OFF TO YOUR HARD WAR
.
Ma'am your explanation is unbelievable.... thanks a lot ma'am 🙏❤️
Finally, cleared the concept !! 👏🏻 only U is left 🤭🤭 to write as last after scanning all ! But it’s totally understanding
Mam.. Out teaching teaching techniques are as beautiful u are
Mam this video is really helpful now I understand this properly thanks for this video
Mam, your teaching skill is awesome...
Can you please give the code in C of the conversion....
when writing final expresion - you have missed 'U' ie QTVUW .... and the same is missed in final reverse string also (ie actual prefix expression)... I dont see any one commenting this...
Didnt see that... Gud
no one is commenting bcz they know that it's a silly mistake not a conceptual or logical mistake.. that's why
Mam, your lecture is very helpful. But you missed the 'U' operand at 13:59. Thank you.
Thank you very much ma'am.
Best wishes for you always.❤❤
Your method is very nice mam. I understood the concept clearly♥️
I think mam did a mistake somewhere, correct answer in prefix is :
+K-L+*MN+*^OP/W/U*VTQ ... Thankyou mam.
for a second i thought u are gving her slangs 😂😂
You are amazing mam...i am watching this just before exam day
Thank you very much mam I was making mistake in due to associativity, Thank you I got it now
Thanks mam i like your teaching 👌👌
mam u forgot to write the u in the first complete prefix check once mam. and thank you for explaining these concepts nicely ..
Wow wonderful mam , we all need great teacher like u mam
In the final expression and reverse of expression, you have forgotten the "U" lying between the W and V in the expression.
mam is always right
Yes she forgot the U lying b/w "w"&"v"
Instead of focusing on that U that maam has left , focus on you .she made you understand the concept that is why you are able to point it out.
True
@@novinjeno7981 no doubt !, I appreciates her for the job she has been doing since many before.
now i can get higher marks on my next quiz InshaAllah (thank you for this tutorials)
Thank you ma'am I wish you were the faculty of our uni..
Upload more mam.you are fabulous! No one can match u in ordert to explanation.
wow ..tomorrow is my exam ..and today I get the video
There is a slight mistake in the answer solved by stack method,
++-+KL*MN*//*^OPWUVTQ
Mam forget "U" in the final answer.
And, No doubt its a great video.
Thanks a lot really enjoyed a lot🥰🥰🥰🥰🥰 the teaching really! Very helpful......
you are such a nice teacher...love you mam
There was one rule not discussed in this example, what if incoming operator has same precedence as top of the stack, however the associativity is right to left?
same here
I think there is a mistake while representing. Operators of same precedence but different associtivity, leads to pop() popping the existing operator. And the other online converters give another output for this question
Content is very clear keep it up
Mam it would b great if u make a proper playlist topic wise.. It's difficult to understand the sequence of ur videos..!
Thanks alot for your nice suggestion
PLEASE CAN YOU GIVE YOUR #
@@JennyslecturesCSIT thanks alot mam.. After listening to ur videos n then studying the textbook again, gives us more clarity which I didn't have 2 months back.. Respect from Hyderabad 😘😘🙏🙏🙏❤❤
Yaha reply krdiya comment ka
genuine teacher #respect
Feeling sad for 'U' in the final expression😂.....jokes apart....nice explanation ma'am....thank you..
very much thanks mam.u r very helpfull.u clear my all doubt
Thanks for the explanation. But you forgot to write U in the last two expression while converting infix to prefix using stack. But no problem, we have understood the concept. Once again thanks for the video.👍🙏
Mam , you are very good teacher and smart good looking
Clear all dout
I could watch u all day, ❤
I like your videos mam. plz.............. plz make more videos my friends are your fans☺☺☺☺☺☺☺
Mam, your teaching skill is awesome...
Can you please give the code in C of the conversion....
Very very helpful class ek bar me samjh aa gya
I find this completely wrong as to treat the reverse expression as if working with postfix expression and finally reversing the expression this
I got :
+k-l+*mn+*^op/w/u*vtq
Above Infix equation to prefix conversion start from 05:26
Thank-you...U teach awesome 🙂🙏
Sorry for telling , The Expected output is not match with this output , But teaching style and knowledge are very professional.
2nd one is damn fast, thanks for these awesome tutorials
Thank u so much maam
You are best teacher 👍
Thanks mam for such a great work 🙏
🇮🇳 "जय हिंद" #Ma'am! Good 🌞Afternoon. #Thank's for Nice information 😎 . ..
Thank you very very much ma'am, it really helped a lot. Thanks a lot.