3.8 Infix to Prefix using Stack | Data Structures Tutorials
HTML-код
- Опубликовано: 10 окт 2019
- 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/profile/Jayanti...
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*
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 ❤️❤️
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!
Mam, Really No doubt you are a good teacher.
Who told then she is bad teacher 😒 😂😂
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
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
Thank you ma'am!🔥this is the first clip for clearing my doubts for infix conversion🔥👍🏻
wow it is so clear explanation. i hope you keep making new videos. you saved me !!!!
I can't thank you enough ma'am I was struggling with this prefix thing very bad.... Thanks a ton
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.
Amazing video with such a simple and articulate explanation... Keep it up ma'am! 💯
Mam ur teaching skills are really very good. I understood each and every topics that u taught. Keep it up👍
Q
MA'AM IT'S SPLENDID!! THANK YOU SO MUCH
soon ur going to dominate other CS channels if u continued making more videos...keep it up
Mam,you are a magician because you fill concept in our mind in only a video ❤️
Mam, these lectures are best! I was feared of this topic. But you have made it very easy. Thanks a lot
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
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.
Speechless , what's the explaination, heads off to u ma'am!
you are the gem....i was not aware of associativity so was getting wrong answer ... now it is clear..thank you very much
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
You are the best teacher I have listened to
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 🤣🤣🤣
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.
Mam,you make my life so easy in data structures
Thanks a lot mam..... ❣️♥️♥️
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
Upload more mam.you are fabulous! No one can match u in ordert to explanation.
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! It really helps
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 your explanation is unbelievable.... thanks a lot ma'am 🙏❤️
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 for great explanation and putting so much effort mam 🙏
Thnkuuu dii for making this video ... seriously Ur way of teaching is sooo attractive which is easily understandable
But I can't understand
Your teaching way is superb.. I understand easily
Wow wonderful mam , we all need great teacher like u mam
thank you for helping me. I followed your many videos. God BLESS YOU.
2nd one is damn fast, thanks for these awesome tutorials
Your method is very nice mam. I understood the concept clearly♥️
Really help me😊 thank you for nicely explained
Thanks. You're amazing. You made it so easy.
Thank you mam,you have clear my all confusion
MAM YOU ARE THE BEST TEACHER OF MINE YOU MADE MY LIFE EASIER
Finally, cleared the concept !! 👏🏻 only U is left 🤭🤭 to write as last after scanning all ! But it’s totally understanding
You are best teacher forever 👍👍
Content is very clear keep it up
Mam, your teaching style is amazing
Thank you very very much ma'am, it really helped a lot. Thanks a lot.
Thank you so much maam.This class helped me a lot 🤗🤗
genuine teacher #respect
Mam this video is really helpful now I understand this properly thanks for this video
Thank-you...U teach awesome 🙂🙏
You are amazing mam...i am watching this just before exam day
Thank you ma'am for this, Tomorrow is my DSA exam, thank you for the last minute preparation
US BRO US
Thank you very much. You are a genius. 👍👍🔝🔝👌👌
Thanks that's really helpful for my exams🤗❤️
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 ma'am, this video is very helpful for me.
Thank you very much ma'am.
Best wishes for you always.❤❤
Thanks a lot really enjoyed a lot🥰🥰🥰🥰🥰 the teaching really! Very helpful......
Great Explanation. Thank You
Thanks My Lovley Teacher For Your Great Contribution To develop My Attitude In DS!!!!!!
Mam, your teaching skill is awesome...
Can you please give the code in C of the conversion....
Simply excellent 👌
I am also same after watching the bloopers.
Voice is so sweet 😘😘
Amazing explanation, keep it up
Mam,if in this case we get 2 operators having associativity R->L as in case of ^.will top of stack be popped or remain as it is?
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.👍🙏
Thanks maam you are a good teacher.
Thanks mam for such a great work 🙏
Thanks mam i like your teaching 👌👌
brilliantly explained thank you mam !
Mam what if we get associativity right to left ?!
MADAM JI , I REALLY LIKE THE WAY YOU TEACH US ALL AND THE CONTENT IS JUST AMAZING HATS OFF TO YOUR HARD WAR
.
you are such a nice teacher...love you mam
Ma'am aap ki way of teaching bahut acchi hai please aur bhi subjects le ke aaiye .... For ugc net exam
Thank you ma'am I wish you were the faculty of our uni..
Thank you very much mam I was making mistake in due to associativity, Thank you I got it now
very much thanks mam.u r very helpfull.u clear my all doubt
I could watch u all day, ❤
Thank u so much maam
You are best teacher 👍
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 , you are a really good teacher
superb explanation mam❤😍
wow ..tomorrow is my exam ..and today I get the video
nice mam , concept cleared.
Very very helpful class ek bar me samjh aa gya
great explanation..thank you ma'am
Wish u all success n happiness in life mam
Mam I love your teaching style
You are great 👍👏
At last I got my answer. Best 👍
Thanks dear mam 😊❤️
Nice video ❤❤
Amazing work really like
keep going mam..good explanation!!!
What to do if the incoming operator has same precedence as that of the operator at top of stack with associativity from right to left
In that case, you have to pop the item from the stack.
*NICE LECTURE*
Nice one..!!