*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.*
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!
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.
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
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.
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
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 🎉
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😊🙋🏻♂️
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
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.
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
*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
Speechless , what's the explaination, heads off to u ma'am!
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 !!!!
You are the best teacher I have listened to
you are the gem....i was not aware of associativity so was getting wrong answer ... now it is clear..thank you very much
Above Infix equation to prefix conversion start from 05:26
Mam ur teaching skills are really very good. I understood each and every topics that u taught. Keep it up👍
Q
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.
I can't thank you enough ma'am I was struggling with this prefix thing very bad.... Thanks a ton
soon ur going to dominate other CS channels if u continued making more videos...keep it up
MA'AM IT'S SPLENDID!! THANK YOU SO MUCH
Thanks for sharing the knowledge 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.
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 🤣🤣🤣
Mam, your teaching style is amazing
Your teaching way is superb.. I understand easily
I think after watching this video there is no doubt for any student like me on this important topic.
MAM YOU ARE THE BEST TEACHER OF MINE YOU MADE MY LIFE EASIER
Ma'am you have not written 'U' in the final prefix expression..you have explained very well.. thankyou
22:23
most important part of video
Thank you ma'am!🔥this is the first clip for clearing my doubts for infix conversion🔥👍🏻
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 🎉
Thank you very much. You are a genius. 👍👍🔝🔝👌👌
Mam ap hamare valmiki guru ho
Apke lecture dekh k me dsa topper ho gaya
Thnkuuu dii for making this video ... seriously Ur way of teaching is sooo attractive which is easily understandable
But I can't understand
Thank you very much mam I was making mistake in due to associativity, Thank you I got it now
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
Mam I love your teaching style
thank you for helping me. I followed your many videos. God BLESS YOU.
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.
Mam , you are a really good teacher
I could watch u all day, ❤
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
Thanks My Lovley Teacher For Your Great Contribution To develop My Attitude In DS!!!!!!
You are amazing mam...i am watching this just before exam day
Mam,you are a magician because you fill concept in our mind in only a video ❤️
Wish u all success n happiness in life mam
You are best teacher forever 👍👍
Content is very clear keep it up
Feeling sad for 'U' in the final expression😂.....jokes apart....nice explanation ma'am....thank you..
Thank you ma'am for this, Tomorrow is my DSA exam, thank you for the last minute preparation
US BRO US
Very very helpful class ek bar me samjh aa gya
Thanks mam i like your teaching 👌👌
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...
Mam,you make my life so easy in data structures
Thanks a lot mam..... ❣️♥️♥️
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
The way of saying "now" is irreplaceable 😊
Ma'am aap ki way of teaching bahut acchi hai please aur bhi subjects le ke aaiye .... For ugc net exam
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.
you are such a nice teacher...love you mam
Nice video ❤❤
6:21 and here we have a QT .😂. APART FROM JOKE. Great lectures.
wow ..tomorrow is my exam ..and today I get the video
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.
Thank you very much ma'am.
Best wishes for you always.❤❤
Wow wonderful mam , we all need great teacher like u mam
Mam this video is really helpful now I understand this properly thanks for this video
Thank you ma'am I wish you were the faculty of our uni..
superb explanation mam❤😍
Mam.. Out teaching teaching techniques are as beautiful u are
Thanks maam you are a good teacher.
🇮🇳 "जय हिंद" #Ma'am! Good 🌞Afternoon. #Thank's for Nice information 😎 . ..
nice mam , concept cleared.
Thank u so much maam
You are best teacher 👍
At last I got my answer. Best 👍
Thank-you...U teach awesome 🙂🙏
brilliantly explained thank you mam !
2nd one is damn fast, thanks for these awesome tutorials
very much thanks mam.u r very helpfull.u clear my all doubt
Ma'am your explanation is unbelievable.... thanks a lot ma'am 🙏❤️
Thanks a lot really enjoyed a lot🥰🥰🥰🥰🥰 the teaching really! Very helpful......
Superb mam🎉❤ thank You very much...❤️
I like your videos mam. plz.............. plz make more videos my friends are your fans☺☺☺☺☺☺☺
Mam, these lectures are best! I was feared of this topic. But you have made it very easy. Thanks a lot
genuine teacher #respect
Thanks mam u saved my exam
now i can get higher marks on my next quiz InshaAllah (thank you for this tutorials)
Finally, cleared the concept !! 👏🏻 only U is left 🤭🤭 to write as last after scanning all ! But it’s totally understanding
Upload more mam.you are fabulous! No one can match u in ordert to explanation.
AMAZING LECTURE MAM
I am also same after watching the bloopers.
Voice is so sweet 😘😘
thank you so much ma'am had data structure exams and will your help I was able to pass 20 marks for one question
Amazing work really like
Your method is very nice mam. I understood the concept clearly♥️
MADAM JI , I REALLY LIKE THE WAY YOU TEACH US ALL AND THE CONTENT IS JUST AMAZING HATS OFF TO YOUR HARD WAR
.
6:18 yess mam QT😍
In 6:30 you can clear ur doubt of difference between infix to postfix and infix to prefix
keep going mam..good explanation!!!
Thanks. You're amazing. You made it so easy.
Thank u so much mam you made me understand😊😊😊😊
Amazing video with such a simple and articulate explanation... Keep it up ma'am! 💯
Me watching video in 2023 for exam really very helpful thanks for creating good video.
Really understable and try to learn in English 👍👍
Thank you very very much ma'am, it really helped a lot. Thanks a lot.