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

[@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

[@ramyakunal4958]

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

[@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

[@dinmohammad8156]

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

[@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 😅

[@lee_land_y69]

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

[@bmdlibya924]

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

[@shriyansh_agarwal]

I am really glad to learn more from you

[@computeradx8825]

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

[@bhartiyasanatandharam8798]

Your English and teaching pattern is excellent, sister

[@computeradx8825]

Thank you :)

[@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 😂

[@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

[@a_.t_s_1021]

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

[@rahulpoddar7732]

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

[@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

[@joelmarkjmj]

THANK YOU MAM YOU AWARDED ME 12 MARKS IN MY EXAM

[@computeradx8825]

Wow 🙏 m so glad to read that 👍🏻

[@buiucthanh4626]

thank you. It's so easy to understand

[@auroralshine6176]

Thank you ma'am, this was really helpful.

[@arihantjain2646]

Beautifully taught ma'am... ty

[@kaustavsaha6900]

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

[@computeradx8825]

All the best for ur xm 👍

[@sayonislam7222]

Explained very well 💯

[@computeradx8825]

Thank you :)

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

[@computeradx8825]

Awesome 👍

[@GAMINGJERRY1]

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

[@RISHABH-VERMA]

Support from India ❤

[@samliger9058]

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

[@vijayvirat562]

Thanks you made it easier to understand 😇

[@computeradx8825]

Welcome :)

[@alisheheryar6306]

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

[@raselmiah3410]

Thanks a lot teacher ❤️

[@usmanweb]

excellent way of teaching

[@computeradx8825]

Thank you.

[@arnabpramanik5703]

its become very🙂 much easy for me to understand

[@sanjeevmaharjan9795]

Great explaination thank you so much

[@computeradx8825]

Welcome :)

[@secretofallthings6962]

thank you so much for this video

[@harshvardhansingh8928]

i loved your video
😍😍😍😍😍😍😍

[@ayushs7766]

You have a very good voice !!!!!

[@mrnaseeb9220]

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

[@nmohammedkaif11]

I'm the 1000th subscriber and

[@magulurivenky6946]

thank u mam it's so helpful for us

[@shubhamverma865]

Really helpful 🙏 thanks ma'am

[@computeradx8825]

Welcome :)

[@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..😌😬

[@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 😑😑

[@suhailahmed505]

Ok ji! It's helpful ❤️🔥

[@rushikmemes5759]

thnx for this video your video is very usefull for me

[@rushikmemes5759]

Please show your face on video

[@mahendrasaini4481]

Thank you so much mam 😊

[@priyanshudkpatrewal4684]

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

[@ecoloudhigh5176]

Mam it's too good and easy.

[@computeradx8825]

Thanks 🙂

[@harshsainigr]

Badiya ji acha samj m Aaya hamare thanku so much

[@computeradx8825]

Welcome :)

[@facti8198]

Tq mam it help a lot❤🎉

[@adityaSingh-wk9jk]

"Okay ji "🥰 adorable

[@sandeshadhikari4785]

thanks from Nepal

[@computeradx8825]

Welcome :)

[@suryashrees5233]

Wonderfull Explanation mam.Thank you

[@computeradx8825]

Welcome :)

[@moeenulislam4189]

Clear and Crisp!

[@computeradx8825]

Thanks :)

[@HiddenBoy-hp1ly]

" Okay ji " sounded Good :)

[@mohdabdulrahmankhan9668]

That "Okayy Jii "😂😂

[@usamamehmood4463]

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

[@amandhol2313]

awesome explannation!

[@aryanmalhotra9143]

excellent explanation!!!

[@chauhan0723]

ye galat exmple hai

[@HarmanNarula]

Thankx a lot

[@darishawanlangpariong7699]

Thankyou mam... Its help me alot

[@computeradx8825]

Glad to read 😃

[@raysash4300]

Thank you!

[@Faltu_Bakchodi]

Recently watched your video

[@RAUNAKMAHAPATRA]

Thanks a lot MAM

[@samyak9134]

Thank you ji

[@APToons]

Lovely!

[@iamjohnwick5192]

Thank you

[@dinmohammadqazi9041]

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

[@computeradx8825]

Thank you :)

[@manikishannayak3202]

Thank you ❤️ Madam 😊

[@shubh_edits865]

Easy very valuable 🙏

[@computeradx8825]

:)

[@prateeknagar147]

Nicely explained

[@moaviahassan721]

3:54 that OK gee🔥🔥🔥

[@amanpawaskar9942]

Hello! will u please explain infix to perfix program 🙏

[@haisumali3729]

thank you

[@AshwithReddy-rd2tc]

explanation is really good

[@computeradx8825]

Thanks 🙂

[@PR_Pavan]

Thanks ❤

[@easy2code]

Thanks.....

[@Noobgaming-hy9yh]

Doing great job 👌👌
Thanku mam 👻👻

[@computeradx8825]

Welcome :)

[@user-lc5cv5db8e]

Thank you mam

[@kyleevalencia1827]

Hello mam. What if we encounter the operator that have the same hierarchy with the top stack like if there are divide operator in stack and in the string i get multiple operator?? should i just push the multiple operator into the stack or pop the operator in the top stack and then push the operand from the string into the stack ?

[@computeradx8825]

Hi.
We follow the PDMAS rule. If / is in the stack and you encounter * then / will pop out and * will then be pushed into the stack.
Similarly if / is the top element of the stack and we encounter / again, / of stack will pop out and / of string will be pushed into the stack.

[@kyleevalencia1827]

@@computeradx8825 I also watch your video about converting infix to postfix using stack but why if the operator in top stack and the input operator have the same hierarchy we still keep the top stack operator and push the input operator although we follow the PDMAS rule ?? It's like the rule also got a little bit inverse

[@computeradx8825]

@Kylee can u plz provide me with a scenario of ur question?

[@computeradx8825]

In terms of operators having same hierarchy

[@kyleevalencia1827]

@@computeradx8825 it similar comparation with * and / or - and +.

[@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..

[@savagegod7620]

Thanks 😊

[@computeradx8825]

Welcome 🙂

[@kinnerakishan5022]

Mam nice explanation

[@yidakanka]

Thanks ma'am 🙌

[@computeradx8825]

Welcome :)

[@aryanjadhav1800]

your explanation is just awesome,loved your teaching technique.Can you collaborate with us for our online learning platform ? Please reply.Thank you!

[@computeradx8825]

Thanks for nice words.
It can be arranged. Please share the details.

[@aryanjadhav1800]

@@computeradx8825 Can i get your email id? So that i can share you the details properly

[@computeradx8825]

[e-mail]

[@ramchahar4143]

Thw

[@dinmohammad8156]

So methodological.

[@poojithaypooja2112]

Tq mam🙏

[@kushalgowda12]

Mam , pls i have doubt, for prefix we just need to reverse the expression and follow the same procedure right???

[@divyanshubhatt2989]

yess

[@_pralhadbehera6341]

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

[@ajay_reddy]

Are u from jammu and Kashmir

[@ramankr0022]

very helpful.

[@bhoomikasaxena1789]

well explained 😇😇

[@user-bv3no6tj8u]

Thank u

[@computeradx8825]

Welcome :)

[@fightforflight6141]

Thnx

[@jyotiramkamble1842]

thank you mam ..

[@computeradx8825]

Welcome 🙂

[@pratyushsahoo4948]

Thanks a lot mam 😊😊

[@computeradx8825]

Welcome :)

[@fo-60sanketpawar45]

thanks mam

[@prathamesh0195]

Excellent ☺️ mam
I

[@jawadaslam8537]

In case of infix to prefix for (Right - Left) associativity.We need to pop top of the stack and check the same right ? Is it true mem ... plz confirm it .. I write an Expression A+B*C+(D-E) on two convertors .. One is giving answer ++A*BC-DE . And other one is giving answer
+A+*BC-DE ... Only Associativity differs ... plz confirm it mem

[@computeradx8825]

We need to pop the top element/s from stack in three cases;
1--> when we encounter a closing bracket (these are closing brackets ), }, ] )
2--> when we encounter an operator (+, -, *, /, ^) having either equal or low precedance as compared to the top element in stack.
3-->in the end when we have evaluated the last character of given expression.
I hope I have answered your question. If not feel free to ask again.

[@computeradx8825]

Second one is the correct answer.

[@jawadaslam8537]

@@computeradx8825 Thanks mem

[@tasniahoque4937]

Thanks ma'am

[@computeradx8825]

Welcome :)

[@muhammadameer611]

No when we reverse the expression parenthesis will also be reverse like
F+D_C*)B+A(