INFIX TO PREFIX NOTATION - Expression Parsing using Stacks | Data Structure and Algorithm

This video will discuss the application of stacks in expression parsing and different notations (infix, prefix, postfix) that the computer system used in evaluating expressions in the Data Structure and Algorithm.
FIND US ON SOCIAL:
Facebook: / techcourseph
KZbin: / @techcourseph
Music: www.bensound.com
#DataStructure #ExpressionParsing #Stacks

[@FREDERICKJOSHUAP.PACLIBAR]

Thank youuuu

[@bluemedian1012]

thank you

[@yurigaming7647]

same lang po ba ang notation ang conversion?

[@bradleymosuela2237]

What if A+B+C+D+C+E po ang sagot po ba ay E+D+C+B+A ED+C+B+A+ +A+B+C+DE po ba ang answer?

[@jaimydionisio1633]

Hello po sir, if ganto po (((((ab+c-d)-e)*f)+g)-h)-i(jk+z)+o/x My answer prefix po is: +--+*-+ab-cdefghi+jkz/ox Pero and answer po ng computer is: +--+*--+abcdefghi+jkz/ox So, alin po dyan ang tama?? Kasi sinundan ko lang po yung tinuro nyo huhu, hindi ko alam kung bakit napunta sa dulo yung minus imbis na between ab and c 😢

[@jaimydionisio1633]

Kapag po ba nasa loob na ng parenthesis hindi na nag po-pop kahit same ang value or mas mababa/mataas po??

[@bradleymosuela2237]

Ang sagot po kasi ng teacher namin sa A+B+C+D+E is ++++ABCDE po naguguluhan po ako kung ano susundin hahaha

[@techcourseph]

Tama ang sagot na yan. Hindi nababago ang arrangement ng operands (letters). Yung mga operators(signs) ay mauuna bago ang operands kaya tama ang sagot n yan

[@bradleymosuela2237]

@@techcourseph Ok po, thanks po