Infix to Prefix conversion using Stacks Data Structure

infix to prefix conversion - possible solutions -- • Infix to Prefix conver...

[@itkasrocks7230]

No, in prefix the same precedence operator can stay together which is not possible in postfix conversion. The prefix will be +-*+ABCDF.

[@ROYAL-THUNDER]

thanks for helping me not to watch this video.

[@adarshjaiswal6457]

you are saying correct ..

[@sarangsankhe5739]

Thanks man, i was scared

[@muhammedaknc179]

Everyone thinks they can make videos with half knowledge. However, she does not have enough knowledge to realize that what she said about the subject is wrong. LOL :)

[@Aaridesigns_shorts]

Check the examples from left to right and use the associative rule according to the associative rule the first operator that we have push into the stack they pop out and then new operator will be push.

[@ayushmaurya943]

Thanks for making this concept very easy It helped me a lot in my tomorrow's exam😃

[@xaviball2911]

the concept which is explained here and some others channel like jennys are different for infix to prefix conversion

[@salaheddinekharchi85]

The same idea of the conversion of infix into postfix, the only difference is the reversing of the expression at the beginning and at the end .. thank you

[@omarhasan1602]

Yeah

[@suhaibkhan4956]

wrong result (A+B)-c/d+e according to your rule output is-*ab+/cde+ but true result is+-*ab/cde, same precedence operator can stay unlike in post fix it doesn't stays

[@love_piano_3000]

Thank you sooo much, you are the ones, who help people like me one day before exam

[@pjacharya]

Nuhh 2 hours before exam 😅

[@joelmarkjmj]

THANK YOU MAM YOU AWARDED ME 12 MARKS IN MY EXAM

[@computeradx8825]

Wow 🙏 m so glad to read that 👍🏻

[@MrKristian252]

Awesome! Learned this in 8 minutes, instead of our teacher explaining for 40 minutes

[@Kishan_Narrator]

i did it in 4 minutes

[@sankhadip_roy]

@@Kishan_Narratorawesome you are selected in google 😂

[@shaikzaveriya9764]

Thank you mam 🥳🥳 it would help me for my 2mrw's exam 🥳🥳

[@computeradx8825]

I pray so... Best of luck 👍🏻

[@shaikzaveriya9764]

@@computeradx8825 tnq🥳🥳

[@gullajaswanth2566]

Where are you from

[@ramyakunal4958]

Now, i came to know the infix to prefix conversion.. in an easiest way.. Thank you

[@kaustavsaha6900]

Too helpful ma'am❤️, tomorrow is my xm. And your voice is so sweet 😊

[@computeradx8825]

All the best for ur xm 👍

[@bhartiyasanatandharam8798]

Your English and teaching pattern is excellent, sister

[@computeradx8825]

Thank you :)

[@dinmohammad8156]

Haha. So awesome. Brings back the fond memories when you explained this to me in person. Really awesome.

[@lee_land_y69]

Tried example ((A+B)/C*(D+E)-F). gave me -/+AB*C+DEF

[@PRAVEENKUMAR-cs5tx]

if operators have same precedence then we will check associativity and here is left associative so we can simply push operator in stack

Thank you Mam. Me is now know this topic very very good.

[@computeradx8825]

Awesome 👍

[@shriyansh_agarwal]

I am really glad to learn more from you

[@computeradx8825]

Its good to know that the video is of help to you :)

[@sujalstark580]

Through out understanding this method I have noticed something sweet thing is encouraging too much !!! To listen and understand this .... Well ureka :) I have found out it's your voice which helped me to reciprocate with this topic thank you so much

[@ecoloudhigh5176]

Mam it's too good and easy.

[@computeradx8825]

Thanks 🙂

[@nmohammedkaif11]

I'm the 1000th subscriber and

[@sayonislam7222]

Explained very well 💯

[@computeradx8825]

Thank you :)

[@usmanweb]

excellent way of teaching

[@computeradx8825]

Thank you.

[@PR_Pavan]

Thanks ❤

[@turamdar1392]

Easiest way to convert infinix expressions into prefix... ❤

[@ashishchauhan4031]

Bcz she took a easy question lol..😂

[@computeradx8825]

Bcz she took an* easy question...

[@ashishchauhan4031]

@@computeradx8825 🤩 me to chk rha tha .... U are passed....muje to cmnt bdane se mtlb h..😌😬

[@bmdlibya924]

thanks so much u made me happy find out it was that simple i was literally hopeless thank u

[@shaiksanamehaboobbi9791]

I've watched this video now and I'm very happy coz it would be very helpful to me for tomorrow's exam Thanks to you 😄

[@shaikzaveriya9764]

I suggested u 2 see this 😒😒 tnq to me also 😁😅

[@shaiksanamehaboobbi9791]

😏

[@shaikzaveriya9764]

@@shaiksanamehaboobbi9791 😎 first thank me.....jaldi bol bol

[@shaiksanamehaboobbi9791]

Ok fine Thank you dear @Shaik Zaveriya

[@shaikzaveriya9764]

@@shaiksanamehaboobbi9791 it's ok .. first go and prepare 😑😑

[@a_.t_s_1021]

Very sweet voice ,beautiful way to make understand by easiest method

[@moaviahassan721]

3:54 that OK gee🔥🔥🔥

[@AngryGamer-RC_Maniac]

Wrong solution dear. From infix to postfix have to pop all the operators from the stack which are greater than or equal to in precedence than that of the scanned operator. But here, we have to pop all the operators from the stack which are ONLY greater in precedence than that of the scanned operator. Only in the case of “^” operator, we pop operators from the stack which are greater than or equal to in precedence. So, in this case, your mistake is at the reading of '-' operator. You should just push '-' operator to the stack after '+' operator and don't pop the '+' operator form the stack. In conclusion the correct result is: + - * + a b c d f.

[@computeradx8825]

We follow PDMAS rule for operator precedence. + is having higher or greater precedence than -, so + will be poped out in order to insert - in the stack.

[@AngryGamer-RC_Maniac]

@@computeradx8825 I am sorry dear, but I already explained you why this is wrong.

[@computeradx8825]

I like your confidence but the thing is I have given u the explanation of what u think is mistake; which actually is not 😏

[@Sanjeevkumar-ce1if]

@angrygamer I think your conclusion is right 👍

[@AngryGamer-RC_Maniac]

@@Sanjeevkumar-ce1if Thank you. Even logically if someone with common sense sees it, undersrands that -*+ABC+DF is wrong. Prefix means all operators BEFORE operands.

[@harshsainigr]

Badiya ji acha samj m Aaya hamare thanku so much

[@computeradx8825]

Welcome :)

[@rahulpoddar7732]

I have watched this vdo and it is great ! Thanks for the vdo ...👍🙂

[@mrnaseeb9220]

Good work we are with you make more videos we will support you We are Pakistani🇵🇰❤️

[@arihantjain2646]

Beautifully taught ma'am... ty

[@prathameshkhorate251]

Thank you ji

[@RISHABH-VERMA]

Support from India ❤

[@secretofallthings6962]

thank you so much for this video

[@alisheheryar6306]

This video reminds me of 1st year in university studying BSSE, that was a lot of struggle

[@auroralshine6176]

Thank you ma'am, this was really helpful.

[@rushikmemes5759]

thnx for this video your video is very usefull for me

[@rushikmemes5759]

Please show your face on video

[@shubh_edits865]

Easy very valuable 🙏

[@computeradx8825]

:)

[@sandeshadhikari4785]

thanks from Nepal

[@computeradx8825]

Welcome :)

[@arnabpramanik5703]

its become very🙂 much easy for me to understand

[@mohdabdulrahmankhan9668]

That "Okayy Jii "😂😂

[@dinmohammadqazi9041]

This is such a simplified method of converting infix to prefix notation. Brilliantly explained mam.

[@computeradx8825]

Thank you :)

[@buiucthanh4626]

thank you. It's so easy to understand

[@raselmiah3410]

Thanks a lot teacher ❤️

[@harshvardhansingh8928]

i loved your video 😍😍😍😍😍😍😍

[@csebhai7231]

I am big fan

[@csebhai7231]

Give me number because I have many dout

[@saikrishna_patel_0768]

This is wrong process in prefix the same presedence operater should not pop it in output . . The correct answer is +-*+ABCDF 🔥

[@adityaSingh-wk9jk]

"Okay ji "🥰 adorable

[@HiddenBoy-hp1ly]

" Okay ji " sounded Good :)

[@sanjeevmaharjan9795]

Great explaination thank you so much

[@computeradx8825]

Welcome :)

[@GAMINGJERRY1]

Thanku mam it’s really very helpful for me 🙏🙏🙏🙏❤️‍🔥

[@moeenulislam4189]

Clear and Crisp!

[@computeradx8825]

Thanks :)

[@ayushs7766]

You have a very good voice !!!!!

[@Faltu_Bakchodi]

Recently watched your video

[@bhoomikasaxena1789]

well explained 😇😇

[@RAUNAKMAHAPATRA]

Thanks a lot MAM

[@mahendrasaini4481]

Thank you so much mam 😊

[@shubhamverma865]

Really helpful 🙏 thanks ma'am

[@computeradx8825]

Welcome :)

[@vijayvirat562]

Thanks you made it easier to understand 😇

[@computeradx8825]

Welcome :)

[@poojithaypooja2112]

Tq mam🙏

[@_pralhadbehera6341]

Mam actually the ans is +-*+ABCDF I have checked my self and even online converter also 😔😔

[@priyanshudkpatrewal4684]

Great...! It becomes quite easy for me to understand it...👏🏻

[@suryashrees5233]

Wonderfull Explanation mam.Thank you

[@computeradx8825]

Welcome :)

[@fightforflight6141]

Thnx

[@magulurivenky6946]

thank u mam it's so helpful for us

[@suhailahmed505]

Ok ji! It's helpful ❤️🔥

[@pragyanshutiwari5904]

Totally wrong🙂 it's prefix conversion and operators stays together when having same precedence and L to R associativity. Answer will be +-*+ABCDF.

[@usamamehmood4463]

There is a mistake. You can't pop the operator if precedence is lower as you reversed the order in the starting.

[@sivansd_t4752]

Without using stack i got +-*+abcdf ??? Both are not same ,why?

[@computeradx8825]

We can get more than 1 correct solutions. However using stacks will always result in the single solution. All the possible solutions can be determined by using expression trees.

[@ashishchauhan4031]

Bro if u will put number instead of alphabet .. then u will get the desired answer from both of the expression.... Ssb expression tree ka lafda h guru..

[@jatingupta9377]

awesome voice with awesome explanation

[@computeradx8825]

Thanks :)

[@jatingupta9377]

@@computeradx8825 are you pursuing M.tech?

[@computeradx8825]

M lecturer in academic industry

[@jatingupta9377]

@@computeradx8825 ohh nice..

[@AshwithReddy-rd2tc]

explanation is really good

[@computeradx8825]

Thanks 🙂

[@darishawanlangpariong7699]

Thankyou mam... Its help me alot

[@computeradx8825]

Glad to read 😃

[@APToons]

Lovely!

[@easy2code]

Thanks.....

[@HarmanNarula]

Thankx a lot

[@haswadhsai618]

Mam, when I changed your given expression infix to prefix , I got some expression , but that one was not matched to your answer. I got : + - * + A B C D F Your answer:- * + A B C + D F

[@computeradx8825]

There can be multiple solutions for a single expression. U can find all possible answers using expression tress. By using Stacks, u will always get the same answer if same rules are followed. 🙂

[@haswadhsai618]

@@computeradx8825 tq mam🤝

[@computeradx8825]

My pleasure 🙂

[@facti8198]

Tq mam it help a lot❤🎉

[@amandhol2313]

awesome explannation!

[@prathamesh0195]

Excellent ☺️ mam I

[@Noobgaming-hy9yh]

Doing great job 👌👌 Thanku mam 👻👻

[@computeradx8825]

Welcome :)

[@aryanmalhotra9143]

excellent explanation!!!

[@chauhan0723]

ye galat exmple hai

[@govindkumarsingh140]

BASICALLY REVERSE KAR KE POSTFIX NIKALO AUR USKO REVERSE KAR DO.

[@iamjohnwick5192]

Thank you

[@ashishchauhan4031]

I like the controversies in the comments section...💫💫

[@kinnerakishan5022]

Mam nice explanation

[@i58yashbagad12]

Infix pre post (fix) are so boring but anyways thanks for great work

[@user-lc5cv5db8e]

Thank you mam

[@haisumali3729]

thank you

[@savagegod7620]

Thanks 😊

[@computeradx8825]

Welcome 🙂

[@SpectronLight]

The brackets will also get reversed and if you know that ur concept is not clear then kindly remove this video as it will provide misconception , make a new video with clear rules.

[@yidakanka]

Thanks ma'am 🙌

[@computeradx8825]

Welcome :)

[@manikishannayak3202]

Thank you ❤️ Madam 😊

[@abdullahhabib5390]

GOOD

[@prateeknagar147]

Nicely explained

[@ramankr0022]

very helpful.

[@tasniahoque4937]

Thanks ma'am

[@computeradx8825]

Welcome :)

[@raysash4300]

Thank you!

[@samliger9058]

What if two operators of addition ++ which have the same priority comes together. Can they stay together or no

[@codmw7040]

Nice