3.6 Infix to Postfix using Stack | Data Structures Tutorials
HTML-код
- Опубликовано: 2 авг 2024
- In this lecture, I have discussed an efficient algorithm to convert infix to postfix using stack in data structure.
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
#jennyslectures #gatecs #dsa
you are the best datastructure teacher i've ever seen, because u teach really well and selects EXCELLENT quetions which has all the possibilities/outcomes , so i hv zero doubts in the end
Thank you! Lots of love from Nairobi, Kenya. Indian lecturers are the best
ruclips.net/video/C0f1gz_MBQE/видео.html
Money heist
How you alive??
Hiii
Where is Denver Tokyo..
I along with my all classmates listened to your lecture before our DSA mid-exam. Your lectures have been so helpful. Thanks you so much :)
me too bro
@@ittzanuptiwari152 attankwadi to me pehle hi tha DSA prh k to tuje danda dena tha bhrwe
@@alphatechtutorials6578 final mein bhi
humra kal xm hay... humko pura classsmate nahi mila is liye gf ke sath dekhne bahtha hu....
@@farhad6365 Theek hai bhai khush reh me bhi ye course pass krne k baad abhi GF k saath hi betha hun
I have been watching your videos from sometime now... I have been working from long time in the industry and it's been to get a quick refresher of these concepts which are fundamental to CS. Not only these videos are relevant to students in school but equally relevant to folks who are working in industry or even preparing for interviews..... This is very good work.... I think it would also be great if you add section in your videos where you can also go through applications of the the algorithm..... Prof. Sedgwick videos are pretty good on that format but it very limited and only about certain topics..... Something to consider as I see you have large community and its only going to grow.... Good work!!!!
Not all heroes wear capes. Some are just really good at explaining infix and post fix. 👏🏾
This is the best lecture for Infix to Postfix on RUclips.
damn! i need to say that you explain everything in a very clear manner...i listen my online sessions and then i search for the same topic here..once done from both platfroms...the topic is very clear in the mind!. thank you so much❤❤❤❤❤
brother now are you doing now? after 3 years?
I have my exams today for data structures i studies all topics but i had doubt in infix to prefix and postfix conversion now i have mastered it thank you so much ma'am
I think this video is going to save my grades. Watching it a day before the semester exam. Thank You so much for such quality videos.
Way of explaining the concept is excellent 👌
I guarantee you that there is no teacher in the world who explains infix to post fix better than this.. thanks a lot mam...
I love watching your videos. You have simplified data structures❤️❤️
Tomorrow is my data structure exam....
Thank you
Bhai Mera Kal h
Mera bhi hai bahi
@@thanosbhai9018 hahahahahahaah
So how much do you guys score in exam??
@@akashlenka4068 in last mid I got,14 out of 20😁.....😂🤣, let's see ......how much I will get Tommorow 😌
Great explanation covered each and every rule it's just amazing.
19:16 mam it's mind blowing lecture ❤ before some day I hatted to read DSA but when I started to see your lecture, I loved this subject so much ❤ thank you so so so so so much maam ❤🙏
Easy, crystal clear, detailed, explanation . Thank you!
mam i was taught that two same priority operators cannot be together in a stack just like that ...but u only explained abt associativity...Thank you so much mam !
You made all my data structure journey .thanks you so much
when i lots of Q. in my mind later I got an answer. this one the great of the skill of a teacher to know audience's minds.
RIP to your English
I think you always top in English!
@@varunrawat599 ya
Rip English 🔥🔥🔥
Yur inglesh es gud😂
First time on your channel mam..felt awesome😇😇😇🙃🙃..love from Dhanbad🥰❣
The best teacher as I have exam tommorow and this video helped me
This is really going to help for my exam, thank you so much.
i have never seen this type of teaching . next level keep it up mam
this is the best infix to postfix tutorial i have found. thanks for the great instruction!
Thanks 😊 mam I was struggling with all these and finally got my something that I could understand fully thanks so much 💗
Really helpful mam.. Thank you for explaining this beautiful concept in single example.
One example and my all doubt cleared...
Just excellent way to explaining...
Thank you so much mam, your explanation is very clearly and informative, before seeing this video I have so many doubts in mind but after seeing this video I got answers for that doubts. Thank you mam🎉🎉
The only youtuber who never pleads you to subscribe or like!
@Wxld.. 😂
Physics Wallah, ALAKH PANDEY
Thank you ma'am, found the video very helpful and easy to follow! 😄
FOREHEAD PAR JO METHOD SOLVING EXPRESSION HOTA HAI AAPKE ...HALF PROBLEM THO USSE HE SAMAJ AA JA THI HAI...AWESOME DEAR ...GOD BLESS NU ALWAYS
Mam yours explaining technique is Awesome ❤
Love u mam💕
Thank you for great explanation and putting so much effort mam 🙏
This will surely get me 100/100 in my board exams, this is very common question in our wbchse cs paper 😃, thanks a lot ma'am 😇 love from bengal 🥳
Oh so you are that GATE air 1 guy
seriously one of the best teachers in the world of DSA love from Pakistan.
tnk u so much mam ..... i really appreciate ur way of teaching . Love from Afghanistan ❤️
Mam i am deeply in love with your explaination techniques..... you are the best....... thank you & love you
Seriously No Words Thank A Lot Mam☺️
way of teaching is very good and this topic is not understand by me in online classes and lot of youtube lectures are seen but not understood
finally i can watch this video and mam really helped me .
thank you so much mam
Yaar ye ma'am kinti achi hai.....and concept bhi clear ho gaya. Thank you.
Ma'am ap bahut achee ho..u help us in every possible ways ❤️
Madam generally I'm not interested in data structures but, after listening ur classes intrested in data structures.thank you mam😊
Seriously , thankyou so much mam for making this topic so simple to understand.
Mam, I really like the way of your explanation and especially your fluent English, Knowledge and confidence 🙏🙏🙏🙏
mam aap itni sundar ho ki mera sara dhyaan aap pe tha, video dobara dekhni padi samajhne ke liye
Bhaiya aap bahot lust vale hai
Thank you so much ma'am. I could score high marks in Data Structures in C and I'm greatly obliged to you for this.🥰thanks a lot ma'am..
Obliged nhi hota chutiye
Chup
Ma'am your videos are very helpful and your teaching style is really amazing.
Thank you so much mam tomorrow is my exam of ds and I can't understand this topic but after seen your lecture I conclude it very well the way you are is much better thank you so much again 💗
Mam you are osm...and your teaching style is also osm
I won't skip classes if you were my class teacher... Thanks a lot.
😏
Thank you so much. You gave a well detailed explanation even better than my data structure teacher at school. I really appreciate😊
thank you so much ma'am, I have been watching your videos for a couple of weeks now, aap nahi hote toh humara kya hota
Thank you so much mam. It's really very helpful.
Thank you ma'am it was very helpful for me to learn how to convert infix to postfix using stack
@@AK-sy2fx After six days
Very helpful videos..... These are of great help to me for exam preparations....🙂
Tqsm for clear explanation ma'am. U have huge patience.
may your channel reach 1 million this year
If the precedence of the incoming operator is higher than the operator at the top of the stack then directly push the incoming operator in the stack.
If it's lower,pop the operator at the top of the stack and then compare the incoming operator with the operator at the top of stack.
If the precedence is same then check associativity.If associativity left to right then pop the top of the stack.If it is right to left then add the incoming operator to stack.
thanks madao
i just love you , great teacher ! thank you for your great explanations
I am from ETHIOPIA .u help me very nice. thanks !!!!!!!!!!!!!!!! CONTINUE
just awesome.. wish i had a teacher like you during my MCA..:-)
After watching your every new lecture:-
Le Me : " Hamare Mnn me aapke liye izzat aur badh gyi ".🎉🎉
The lecture you tell that's always in my mind.... Bcoz the way your teaching can't forget madam... 😉🙃
Amazing teaching skill, My all doubts are clear now... Thank you for this precious lecture
Another very good explanation from Jenny. Thank you! I have one question though. What we do in a case like this? (1-2)+-(-(-(-4))) or this? 2/2+3*4.75-(-6)
Maybe we can iterate ones and convert all the -- to +, just an idea
#include
using namespace std;
int precedence(char x)
{
if(x=='+' or x=='-')
return 1;
else if(x=='*' or x=='/')
return 2;
else if(x=='^')
return 3;
else
return 0;
}
void infixtoPostfix(string s)
{
stack st;
string result;
for(int i=0;i='a' and c='A' and c='0' and c
Then You Should Stop Attempting The Question
EXCELLENT 💓 MADAM
This is a High quality explanation !! i ever saw ...Thanks so much Jayanti !!!!!
Very well explained need like ur teacher in our college and I appreciate your hardwork 👍.
Excellent way of teaching 👌
I am grateful for the kind words and encouragement
thank you maam🥰
Very well explained Mam!! Books couldn't clearly explain all the intricacies properly!!
Many many thanks🙏🌹❤ to you!!
Way of explaining the concept is really Osm... Thanks alot for share this topic..
Thank You so much , Jenny :)
Thanks mam ...aapki smile bdi pyaaari h ☺😊
abey salle
Best ever and simple explanation I came across👍👍
Am really thankful for u mam amazing class no words more can say
It would be great if you could explain the codes for infix to postfix conversion and postfix evaluation ma'am . Thankyou for the lectures
Mam, In the rules you have told that if equal precedence operator has come then simply pop out top of the stack and print and after that simple push the incoming operator.But in example you have recheck the the incoming operator with stack even after poping.How??? I'm little bit confused.
Thank you! Lots of love from Khulna,Bangladesh . Indian lecturers are the best.
May God bless you for explaining it so well 🙏 💖 😊
Love uuh...❤❤
Pagal
Mam I seriously want to thank u frm the bottom of my ❤️. You saved my dsa paper frm getting supply ..now u became my favorite mam as well as crush too
Seriously u r so cute and the way u talk ND explain...I m in love with ur personality
Paper 16 n h
how desperate are you man. lol
amazing explanation of this topic thank you,u r brilliant
It's really helped me a lot dear at morning time before exam ...😂
Really loved it ..❤
Even i am learning this because of you mam although my branch is civil engineering
Ye thoda jyada ho gya bhai😂😂😂
Dekne ka motive thoda kuch aur bhi hai naa
can someone hear "Now" that she said at 9:26 in loop, its simply awesome..
😂😂😂😂
meow**
Very very thanks
I have to seen many lecture but I am confused
When I saw your lecture I am completely clear to solve this problem
Thanks ma'am, you made it so easy.
Your Smile 😍😍😍😍
I am here from jobless guy ❤
Thanks mam finally I am understand that how we can convert infix to postfix expression
Thank you so much ❤️💕 this video helps me a lot.
한국어 자막 잘 만들었어요.
I can live by watching your smile
fuk you broda
the way you explain the topic was excellent thank you mam.......
You are the one who is saving It students life🙏 thanku mam🙏
YOUR VIDEOS ARE HELPING ME SM. THANKU SM MA'AM!!! YOU DESERVE SM MORE 😭💗
When do we use this infix to postfix conversion. Can you point out some real time examples please. Thank you!
The computer memory first converts the expression from infix to postfix and then perform calculations
compiler
Thank you for the wonderful explanation.. It was really helpful
Very good lecture. Understood the rules clearly.