Application of Stacks (Infix to Postfix) - Part 4

Data Structures: Application of Stacks (Infix to Postfix) - Part 4
Topics discussed:
1) Algorithm for converting the Infix expression to its equivalent Postfix expression.

Music:
Axol x Alex Skrindo - You [NCS Release]

#DataStructuresByNeso #DataStructures #Stacks #ApplicationOfStacks

[timstevens]

Best video series on this topic !
Very well done !

[sravanisravanam]

No one explained this point. its really great sir

[robertofranciscoriosmorale]

this video is pure gold, awesome knowledge and explanation

[justaheroforfun]

answer of homework will be : 854^2+*62^93*/-

[rakadking]

explained very well, I always found it amazing while watching this channel video. It always helps me.

[wind_mill]

iam very lucky person because iam a subscriber of NESO ACADAMY

[madhusudhantd]

Really explaination is very clear and I love it

[mohanapriya]

Sir please make a playlist like this as for python programming ...

[rajupaari]

Sir, please take a python courses your video is clear cut concept

[sauravjeffrymahanta]

9:36 If we assume the left parenthesis to have the least precedence then shouldn't we have popped out the "+" in the stack before pushing " ( " ?

[mgatech]

5:36 *>=+ but why else part.... I don't understand

[abdelmalek]

Nice video, however i have a question, for the condition of the operators, could i say if the precedence of the current operator is greater than the precedence of the operator at top of the stack ?

[saniyamansuri]

Plz do mention the answers of asked questions.

[ajgaming]

If left parenthesis has the least precedence, why wasn't - compared to the + operator in the stack, rather it was ignored. @9:36? I need a clear cut explanation on this please.

[ynimation]

I didn't understand point when they compare * with + ??? Please someone * precendence is higher Than +, why we didn't pop them out ??