Data Structures | Infix to Prefix Conversion

In this video we will see how to convert infix to prefix expression
#datastructures #infixtoprefix

[@unity3dconcepts434]

This video is better than the postfix. You made things complicated in the postfix video. When explaining point 6 you didn't follow the rules correctly and I got confused there. After watching this my doubt of POP and PUSH is cleared. You need to reupload that video.

[@Aashutosh_Bajaj]

hmm

[@ompatil3620]

Thankk you so much sir....
In this week I've my finals...and I'm getting some confidence after watching this 2 vdos ..that is infix to postfix and prefix...
Explanation understandable..dil se thank u ❤

[@ming5609]

your vdo make its alot easier to learn in class,thanks (indian guys will carry you🤣)

[@jackcapital7426]

REALLY WAS WORTH IT WATCHING THIS ,
KEEP UP THE GOODWORK SIR

[@lavkushpal6167]

Amazing explanation
So be continue
Thanks sir

[@neerajmahajan9457]

Very Good and Simple Explaination

[@bgmihunter2882]

Simple and best explanation sir

[@HiteshZore-l5s]

Thank you so much sir ❤🥰🥰

[@somalasrestha1283]

great explanation

[@greyhouse9827]

loved the video sir

[@suyashsathe826]

Best Lecture Ever!!!

[@heeniebeenieboo1557]

I just realised that even our teacher gave ur the same example! Maybe he saw this video too! Haha thank you it cleared up all my doubts

[@ranadas4934]

most easy way to solve it! great.

[@sahelisaha366]

Well explained sir..

[@mohammedhamza9894]

bhai zabardast thanku sir

[@vikrant5211]

You are best Sir ji ⭐

[@lordstinson8095]

Great video! Just improve audio quality with some good mic and you're all set. :)
Is there any way to evaluate infix/postfix expressions in case of *unary operators* ?

[@sufiafarheen]

Tnqq so much sir tomorrow is my final and u save me🥲

[@_GayatriShetkar]

Thankyou sir!!!

[@AnkurYadav-yn2se]

Thankyou SIR in making it VERY EASY

[@devilravi1293]

Nice explanation

[@SamuelEA1]

Nice... Thanks 🙏

[@avenger1898]

thank you sir, but i have a doubt, go through the example once (A+B)/C*D-E after converting I am getting the answer as -/+AB*CDE is it correct or not ?

[@crcharan6076]

No

[@devuyogi5764]

flawlesss..🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰😍😍

[@dbsrohan708]

Mass explanation bro

[@varshasable3118]

Explained very nicely

[@aditidhumal4566]

Thanks for this

[@thecityhub8833]

nice video

[@zudzudin]

amsyar

[@carolaosorio5015]

You are great! thank you my friend!

[@tayyab.sheikh]

Pause the video and try to solve it on your own!

[@user-kk8jd4fi3o]

Thank you soo much sir ❤

[@ranush5310]

Thanks 🙏🏻 sir helped me

[@vivektact]

Nice

[@Rechu_Joseph]

Thank you 🙏

[@memeworld3172]

thankyou sir🙏

[@heelsadhna]

Best

[@suhitharenuka827]

Thank you soo much🙏🙏

[@thehackersworld4049]

❤❤❤❤❤

[@rachamaduguswathisurekha6540]

Tq u sir 👍

[@divyanshimuvaniya1902]

👍

[@lilbille]

thanks :)

[@sacida183]

dam bro ,just safe my life

[@rajchandradeep4671]

At 3:57 dont you think * should be poped out

[@abegailgraceulanday8830]

No. Since * precedence is higher than + so there's no need to pop. unless its vice versa.

[@AmanAhmed-gc1pu]

ty

[@theretrotv3947]

a + (b-c) *d/(e * f)
Pleas convert into prefix and postfix

[@HarshithaNagaraj-z7e]

How to do if % in the expression

[@justzeno9014]

Its modulo , it will be treated as *,\ similarly

[@emir5088]

bi di pavir ksmdkaks thanks bro

[@venkatasainitingubba8061]

damn

[@frontback4574]

What if top of stack contain + operand and upcoming operand is also + , should we push or pop ??

[@ritamsarkar7753]

in that case pop old + and try to push new + to the stack (at the time of push it will again check with remaining top of the stack one by one)

[@frontback4574]

@@ritamsarkar7753 thank you .

[@arkabanerjee1091]

We should push the operator in case of infix to prefix conversion, and pop in case of infix to postfix conversion

[@bhaktimantra03]

Plz anyone know me which one is right?

[@tejaskutal2922]

Why did we pop out this symbol ^

[@_sanjana-]

Because ^ symbol has highest precedence

[@shuppandi]

Left hand? Ohw