When I was in class 8 you posted this video, now I am in 8 semester of my CS Engineering and watching for the preparation for tomorrow's final exam. If you got this comment thanks a lot buddy❤
4 am studying for my CS final and was about to consider not memorizing Infix to Postfix because my professor's explanation is quite confusing. Glad I found this video because I understood so easily. Thanks!
You're a life saver Sir. I was having a difficult time understanding precedence and in which case what should be popped but you made it super easy. I hope you're doing well wherever you are in life. I can't help but be grateful for the wonders you've done. Thank you very much.
Thanks ! My new geeky/nerdy hobby is to play with vintage calculators, including RPN ones. This method is fast, easy, algorithmic, efficient, no-arithmetic-tree-required : I love it !
Dude, this helped me so much! Props to you! This has really simplified my understanding of how to convert infix to postfix, which might show up on my midterm. Thank you so much!!!
best example for this conversion as it cover different 3 problem at a time . BY solving this question u can solve any question without confusion ....thank you for this video.
Rules>> 1)If the newer operation has higher priority then only it gets to stay in the stack column. 2)For checking priority we go only till '(', hence this means '*(-' is a valid entry in stack column on the entry of '-' -comment if I am wrong!
The video was pretty well made. Thanks. Helped a lot as I have my exams in a week. Also I wanted to ask what happens when there are two same operators one after the other?
Ab aaya samaj me sirji mai e first ek ma'am ki video dekhi thi thoda last me confusion ho gya tha unka bhi tarika sahi thaa but aapke video se really samaj aa gya achche se👍
Master log bas chije gumate hai. Direct concept nahi btate. And this man here is directly giving the concept which makes him different from others. Hats off dude
Thank you ! It helped me a lot. It was more straightforward and clear than in my class. Now i am just wondering why i did not understand it at first. ^^"
I can't believe i finally understand this😭, thanku so much sir😭♥️ no one can explain this better than you, it was thaaattttt simple 😭 thankuuuu so muchhh
Uploaded 9 years ago, DULL camera, low voice. LEGENDARY.
yup bro
why can't teachers make it so simple, thanks man, good job, you helped me alot.
Agreed
They teach the same simple way but we don't study that time. We busy that time and in these we study with concentration :)
Dhruva Agarwal 027 true
Bcoz they have taken oath
Exactly 🙁
When I was in class 8 you posted this video, now I am in 8 semester of my CS Engineering and watching for the preparation for tomorrow's final exam. If you got this comment thanks a lot buddy❤
4 am studying for my CS final and was about to consider not memorizing Infix to Postfix because my professor's explanation is quite confusing. Glad I found this video because I understood so easily. Thanks!
Im doing the same thing at 330 AM XD
@@VarunSrinivas 2:20 am ...
@@SRP47 padh le Bhai cs nhi milegi acchi college me lol jk
1.30am
@@rajKSvines bruhhh
Really amazing buddy ... You save my 3 hours .....
Thousands of thanks
Anes
Anes P.A what does your name mean
Butthole
Anus
🙏🙏🙏🙏
And also marks sir ji.
You're a life saver Sir. I was having a difficult time understanding precedence and in which case what should be popped but you made it super easy. I hope you're doing well wherever you are in life. I can't help but be grateful for the wonders you've done. Thank you very much.
Great video. Thank you for avoiding specifics, this is concise and simple. A great pre-exam brush-up!
Indians are always helpful
@@aryxslayer04 l swear bro you right
Thanks ! My new geeky/nerdy hobby is to play with vintage calculators, including RPN ones. This method is fast, easy, algorithmic, efficient, no-arithmetic-tree-required : I love it !
I saw this video for once and executed the whole code on my own !!
That's a great explanation mate.
Dude, this helped me so much! Props to you! This has really simplified my understanding of how to convert infix to postfix, which might show up on my midterm. Thank you so much!!!
Clear, concise, easy to understand the concept and your voice. Thank you for uploading.
Thanks for posting! It helped me figure out how to do my programming assignment. Writing it on paper made it clear on how to actually code it
For those who are confused, the first letter he puts down isn't C, it's a parenthesis, or "bracket".
u are a genius
Kamaal ka knowledge hai aapka bhai
@@rijulshrivastava999 still searching who asked
@@NitinKumar-xx4xh found them ?
ruclips.net/video/fITzheZ-qPU/видео.html
I sat through 2.5 hours over two classes and still left befuddled. You cleared it up in under 6 minutes. THANK YOU!!
Thanks bhai for making this video...
now I can sleep in peace... :-)
Rip
Why not rip
padh le bhai
Nice work bro, best explanation I've seen/read/heard so far. :)
Don't judge a book by its cover; the best explanations often lie beneath the surface.
Ohh Bhai college me Dimag Karab kar Diya tha.. But now I understood Well... Very good Explanation
I always revisit this for a refresher. Perfectly made. Thank you!
Better than the others I watched. Thank you sir!
Thank you! I couldn't find information on how to handle operators with different priorities, and your video helped.
best example for this conversion as it cover different 3 problem at a time . BY solving this question u can solve any question without confusion ....thank you for this video.
Wondefully explained....Now i really understand this....thanks so much.
You're an amazing teacher. Thanks (Y)
wow that was much easier than I thought !! Thank you for explaining so well !! :D
Thank you! This was way better than what I learned in class.
Thank you so much for explaining this! This is extremely helpful!
Rules>>
1)If the newer operation has higher priority then only it gets to stay in the stack column.
2)For checking priority we go only till '(', hence this means '*(-' is a valid entry in stack column on the entry of '-'
-comment if I am wrong!
Really helped me bro.
A big thanks to u
U made it so simple to understand .
Keep making data structure easier with the help of ur videos.👍👍👍👍
To the point and with a great set of example!!!! Made my day.
What about if we have two smae operators for exapmle ^^ in the stack, how can we manipulate it ?
The video was pretty well made. Thanks. Helped a lot as I have my exams in a week. Also I wanted to ask what happens when there are two same operators one after the other?
Thanks a lot man! You made it so easy and simple! Love your video!
Thank you very much, dude!
You're easily explain how it works!
Wow well explained!
Thank you so much! It was really helpful!
thank you very much it just saved me before my computer board exam very wonderfully explained 😊
This is so far the best explanation I have ever received! Thanks! Thanks a tonne Bro. 😊
I have a question its really serious ... Why did you brozone him ... he did you a favour and you do this to him
Clearly shame on you
Its 2:38 am and tomorrow in the morning 9:am I have my mid meanwhile me doing preparation 🤣
Same situation bro 😂
Me2
Easy to understand the concept. The video really helped me...... After all a big thankz🎉
Amazing video taught me for sure....... Got my exams tom indeed very handy tutorial
It helped me to understand data structures in stack easily
Ab aaya samaj me sirji mai e first ek ma'am ki video dekhi thi thoda last me confusion ho gya tha unka bhi tarika sahi thaa but aapke video se really samaj aa gya achche se👍
Really thanks a lot bro
You saved my time
Keep on going
Master log bas chije gumate hai. Direct concept nahi btate. And this man here is directly giving the concept which makes him different from others. Hats off dude
Having DS exam today.This clarified my doubts
You are the GOAT my dude, just what i needed
Love you man..... Love you ....
Such a good video.... Keep it up man... You don't know how happy I am to understand it at last
thanks a lot buddy.for explaining it so simply.
If there are more than one operator b/w () in stack
Like (+*)
then how pop operation would be, in what order?
are bhai kamal kar diya,really thanks to you from my heart,this thing stuck in my throat ,now it is clear.
The way you made it simple and delivered is awesome 👍👍
Last moment learning made easy .. Thanks!!!!! Will recommend to all
Same :-)
Thank you so muchhhh!!! That really helped... Now I m crystal clear😍😍😍
it is truly a comendable video.....thanks man!!
Excellent simple visualization! Thank you!
amazing video man! thanks alot you just saved me hours of trying to understand the text i have !
Quick and easy explanation. Thanks a lot !!!
bro you made it very simple..............
thanks a lot
today is my board exam........
wish me luck................
The hero we deserve👏🏻👏🏻good job mate
Help ful.... Vrna fir teacher se pucna pdta... Or vir vo cillate.. Thanks bhaii
ITS REALLY VERY GOOD THE BEST EXPLANATION I HAVE EVER HEARD
Thank you so much yaar. You are a best teacher 👌
What abt infix without parenthesis? the operators that left in the stack need to be pop out or leave it?
Thanks for the clear explanation 🙏🏼💕
Thank you so much sir understood greatly
Thank you ! It helped me a lot. It was more straightforward and clear than in my class. Now i am just wondering why i did not understand it at first. ^^"
Very simple & straightforward explanation 👍🏻 tysm
A very nice explanation bro ... U deserve more subs... Who the hell disliked this video ????????
what if a bracket in a stack column contains more than one operator? e.g. ( + - ) ...would both be placed in postfix column or none would be placed?
much easier than I thought....
thnks dude :)
Priority checking is wrong we can put * after /
Brilliant. I watched many other videos but none of them explained so well.
b
Perfect example. Thank you so much. It was indeed very easy explanation.
If Two operands comes in closing parenthesis what could be do...?I mean to ask which one could b pop out either one or both?
I can't believe i finally understand this😭, thanku so much sir😭♥️ no one can explain this better than you, it was thaaattttt simple 😭 thankuuuu so muchhh
I love u ❤😘
thank u so much for this clear explaination
Thank you very much, much simpler than i thought
Thanks dude! 5mins video....infix to postfix problem solved for lifetime.. :D
good explanation.Understood the concept clearly.Thank you
Thanks bro tomorrow is my preboard
This concept was troubling me a lot
THANK YOU!!!! You literally just saved my life as a college student TT^TT
Please also explain when there is no bracket in last(means an operator at the last position)?
Thnx a lot bro 😘💜.my best wishes is with you
Nice one sir .Just helped me a lot before my computer board exams
Thanks bro .. u'r explaination is really awesome
thank u very much,well explained,now got some confidence
Awesome video and nice way of explanation. No words to say bro !
Bro thank you so much,Had an exam this morning and it could really help me
Very well explained, I like that you went straight to the point.
Thanks bro, see how in such a simple way u taught us the whole thing:)
very simple and understandable thank you so much!!
your example was good,covering all conditions in it.
You teach very well, thanks a lot ❤
Thank u bro u r teaching skilll is nice.....Now i understand how to evaluate infix expression
Bro you explain nice. My all doubts have been cleared.
TY SO MUCH SIR, YOU SAVED MY LIFE !!
Your video is perfect then other infix to postfix videoa... Thanks bro
so it's fine for the +*+ to happen on the stack?
Thankyou for the video..What if there are more than one operators inside the brackets and what if the brackets repeat successively at the beginning
Thanks for this short video
It helps me alot
Omg! u explained so clearly in 5 minutes thank u so much sir