Data Structures | Infix to Postfix Conversion

preview_player
Показать описание
In this video we will see how to convert infix to postfix expression

#datastructures #infixtopostfix
Рекомендации по теме
Комментарии
Автор

bro is a life saver, my teacher never gonna make it easy to understand 🙏

นายวุฒิภัทรบุญญานุวัตร
Автор

Convert the following expression into postfix

i) A/B $ CD * E-A*C

ii) (A+B*C-D)/E$F

AkshadaGawali-sh
Автор

Nice explanation but, there is little bit mistake explaing when *is top element and + is the income operator then we have to pop * (because of higher precedence than +) and push + operator in stack but you written different..but it's ok concept is clear..

shristiverma
Автор

9:40 how its not (-(- ??? i think it would be +(- ? but you write another ) but its not brackets inside in the question ?? you added more brackets

sxibvdl
Автор

4:50
You have to pop the TOP before pushing the low precedence operator.
What you said is directly push it
How can * + remain in the stack
* has to be popped for + to get pushed.
You confused yourself and the all of us.

mrpray
Автор

Confusing video. You have written something else and you are speaking something else. On Left point 6 you mentioned to POP and PUSH but watch your video what you are doing when explaining the */. You simply pushed the operator and ignored POP but then later you considered the POP when going from LR

unitydconcepts
Автор

First you need to understand the concept .

lsd_luxfera
join shbcf.ru