finally understood the concept before this i have checkd apna college, code with harry, jenny etc but didn't understand the concept thank you anuj bhaiya !!!!!!
00:00 In this video, we will cover infix, postfix & prefix expressions and their conversion 02:02 Infix to postfix and prefix conversion involves considering operator precedence. 04:14 Conversion of infix to postfix expressions using stack 06:04 Convert infix expressions to postfix and prefix 07:55 Conversion from infix to postfix and prefix expressions using stack 09:40 Convert infix to postfix expression using stack 11:32 Converting infix to postfix simplifies solving expressions for the compiler 13:15 Infix to Postfix conversion simplifies expression evaluation
This will be more clear in the next video, where we'll learn how compiler converts infix to postfix expression and how it solves the postfix expressions.
Learning from a junior was never this enjoyable before! Way to go brother! ❤️
Have u got placed?
Toh aap Anuj bhaiya ni bolte honge na
I never saw something more beautiful then this explanation!!!
Hats off sir!!!!
you are one of the best computer science teachers on youtube 💝
Ek video , Sara fanda clear😂😂 thank you ❤ iski both jarurat thi , aap both khush rahe
now the revolution is not so far when anuj bhhaiya is the upcoming storm on youtube for placement courses !! Love you from ghaziabad
Me too from gzb
@@mahakgarg3152 from which college and where
@@HarshMishra-pu1rn UPES dehradoon
@@mahakgarg3152 I mean from where u belong in gzb
I am From AKGEC
@@HarshMishra-pu1rn I am currently in dehradoon studying in UPES
thanks bhhaiya ji it will help us a lot in our journey to DSA
thanks bhaiya for new video on dsa and please keep complete this series of dsa asap. we have our placement season
Thankyou sir.....❤ Kal Mera exam hai....apne bacha liya 🤗
Our professor just thaught us how it's done but never told why this is thaught , great video 🙂
Ur questions are asked in my interviews thx
thank you bhaiya for a nice explanation . ..
😃😃😃😃😃😃😃
Finally get that video where all concepts solved by sir and all doubts solved by comments. thanks sir (a way Better than college)
finally understood the concept before this i have checkd apna college, code with harry, jenny etc but didn't understand the concept thank you anuj bhaiya !!!!!!
Crystal clear explanation ❣️❣️
This vedio is most helpful for me thank you sir
great explanation 🙂🙂
Thank you so much sir🙂🙂
Excellent explanation sir👍👍🙏🙏keep it up👍👍
Thank you bro
Mujhe bahot achhi tareeke se samajh aagyi
Thank you so much😊❤❤❤❤❤
00:00 In this video, we will cover infix, postfix & prefix expressions and their conversion
02:02 Infix to postfix and prefix conversion involves considering operator precedence.
04:14 Conversion of infix to postfix expressions using stack
06:04 Convert infix expressions to postfix and prefix
07:55 Conversion from infix to postfix and prefix expressions using stack
09:40 Convert infix to postfix expression using stack
11:32 Converting infix to postfix simplifies solving expressions for the compiler
13:15 Infix to Postfix conversion simplifies expression evaluation
BODMAS stands for Bracket, Of, Division, Multiplication, Addition, and Subtraction.
Wonderful explanation ❤❤❤❤
Easy explanation 👍 understood
Thankyou 👍
better and deep explaination than @apnacollege i shifted from apni kasha to anuj bhaiya .I am not comparing but giving my feedback.
thanks bhaiya, bahot easy way se solution bataya 😊
Well explained❤
thanks sir for explaining this concept
Aaj hi main socha ki ye topic ka koyi acha video miley
.... And its here
Thank you🍀✨
Thank you bro, dil se shukriya 🙏🙏🙏
Bhaiya online to bahot log padhate hai per apke sath padhne ka kuch alga hi feel hai
literally the best video on this out there. understood everything i needed to for the first time in two years of taking this course 💯
thanks a lot sir...had been searching on youtube for the trick and found your trick to be the best among all the other videos
Bhai phod dala ❤ sukriya as a guide being there ❤
thanks bhaiya. covered the topic and the best part is liked the outro music of the video
me sach bata Raha hu muze Aaj samaj aaya postfix infix prefix
Thanks Manh!! REally helpfull for Exams
Thank you so much , after watching alot videos, i found proper and easiest solutions here.
Thank you 😊☺️💞 sir
Osm explanation bhaiya
Nice bhaiya...
Yes, great video 👏👏
LOVE U ANUJ BHAIYA 1 DAY BEFORE EXAM
Please make a 60days roadmap for DSA beginner to crack tech giant's like Microsoft linkedin level companies
Good
60 days Jada nhi hoga 6 din yaa 6 hours ya 6 min kr lo 😂😂
@@ashusrivastava3200 6 min bahot shi h🤣🤣
I have leave conversion question in 1st term and qty now i am watching this before 30hrs of dsa exam hope i can solve this type of question
Really helpful 🙏👍
Nice video...you cleared my doubt. 👍Thank you 🙌
Thank you sir 😊
Always enjoy learning with bhaiya.
Great Sir
wonderful
Bhaiya isi ki to talas thi....😃thank u bhaiya 🙏 again apko Mann ki bat pata chal gayi 😂
You are from...
Excellent
Shukriya bhaiya. Boards aane wala h. Abhi padha ikdam samajh mein aa gya❤
Bhaiya please make a video on what is *_AWS_* and *_Microsoft Azure_* . I literally do not have any idea about these.🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏
way better teaching than my college teacher
Bhaiya plz complete as early as possiblt
Thanks gor stack expressions
explained very beautifully
amazing playlist
When you will cover DP plz cover it in detail... I mean from intuition to code..
Thank you sir
thank You Bhaiya
At 11:30 i have a dough how compiler get know that we have to divide bc by d not of abc by d i think a position is not correct
This will be more clear in the next video, where we'll learn how compiler converts infix to postfix expression and how it solves the postfix expressions.
We r not dividing bc by d at all actually b/c and result is multiplied by d and compiler knows using stack as explained by bhaiya 13:37
@@siddhantsingh2394 yes bro later i got that
As you first solved infix in postfix (1)abc*+ why not (2) ab+c* instead of cba+* ?
Bhaiya, who didn't know c and c++
And also don't know basic coding
Can they learn java easily..
Because i enrolled in your course starting from 31..
Bhaiya video daily upload kar diya kijiye 🙏🙏🙏
Bhaiya please make a detailed video on algo trading please bhaiya
thank u
Can the answer of 2nd expression at 11:26 be abc∗d/e∗−f+ ?
Please solve one question as well using stack.
nice video
Bhaiya pls make a video on tcs codevita..🙏
Gajab insaan ho yrrrr ye to bata hi nhi rahe ho ki value kb aage hogi kb peeche confused littelraly
#AnujBhaiya dsa course python ke baad karte hai kya?or agar python ke baad krte hai to aapka python course kab aaraha hai ? we r waiting
Anuj, dijkstra pe ek video bana do.
It'll come soon, when we'll be covering Graphs in detail
👍👍👍👍👍
Sir you are really god ❤️❤️🙏
Sab smjh aya sir bs last me Left to right bolaa vo Ky tha
bhaiya infix to prefix ki bhi video bna do
ab/cde*-*f+ please check according toi me this is correct for the 11:00 minutes solution
Sir python kab tak aayega
next video kab arai hai isske 🙄
Code kahan hai converion [infix to postfix or prefix]ka ??🙄🙄
sir last mein 3 2 + 7 4 - *
Bhaiya ees kaa program karna bhi sikha oo naa
Bilkun samjh nai aaraha hai
But prefix fir kyu sikhate h ...
Postfix sai kaam chl he rha h to
First
ok
: abc*d/e*-f+ this is the correct answer you have done wrong
Really
@@__nitt_in yes
2nd
Ye wrong hai 7*5 kitna hota hai
35
i dont get your explanation. poor explanation not recoomended
Jhant nhi samajh aaya
galat solutions hai kuch beware
Amazing way to teaching 🎉🎉
Thanks sir❤
Thank you sir
thank you Bhaiya
Thank u