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.
Data Structures: bit.ly/3hjudFV
C Programming: goo.gl/7Eh2SS
Follow Neso Academy on Instagram: @nesoacademy(bit.ly/2XP63OE)
Follow me on Instagram: @jaspreetedu(bit.ly/2YX26E5)
Contribute: www.nesoacadem...
Memberships: bit.ly/2U7YSPI
Books: www.nesoacadem...
Website ► www.nesoacadem...
Forum ► forum.nesoacad...
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#DataStructuresByNeso #DataStructures #Stacks #ApplicationOfStacks

[@justaheroforfun8393]

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

[@kanisaeed463]

thankuuu

[@wog4299]

Ans :854^2+*62^93*/-

[@MrRafay474]

same

[@nikhilpatil2211]

Barabar hei bhai ek number 👌

[@vipullahepatil5529]

ans 854^2+*62^93*/-

[@animatedguess6884]

Bhai answer galat hai

[@vixxkigoli345]

@@animatedguess6884 Sahi answer he bhai, mene khud perform kiya he

[@avendersharma8532]

854^2+*62^93/*--

[@timstevens3361]

Best video series on this topic !
Very well done !

[@abrahammulualem7803]

It helped a lot. Thank you

[@sauravjeffrymahanta422]

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 " ( " ?

[@ehabmagdy242]

It's in another if statement, we push the left parenthesis before we compare it to the operator in the stack

[@dhirtimankhati8376]

In the algorithm we were to only compare operators with operators and left parenthesis with a right parenthesis

[@robertofranciscoriosmorale4158]

this video is pure gold, awesome knowledge and explanation

[@varadeepvaradeep1883]

Please do a lectures on trees also

[@sravanisravanam1054]

No one explained this point. its really great sir

[@rajupaari5162]

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

[@ajgaming7167]

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.

[@producerseph_]

It is one of the rules that if the symbol is a left parenthesis, just put it on the stack.
So the left parenthesis is the only symbol that is not compared. Once you see it, just put it on the stack.
(And anything under it in the stack is not touched)

[@rohitlawand667]

when we put left parethesis on to stack ,assume that below elements of left parethsis are not there and stack is empty .

[@wind_mill8149]

iam very lucky person because iam a subscriber of NESO ACADAMY

[@tinA-cn1on]

Thank you sir 🤗😊

[@dogsgallery2199]

Nice..

[@rakadking]

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

[@ynimation787]

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

[@turtle164]

NO , the operator present in the stack should have greater precendence than the current operator, so * is the current operator and has high precedence than + operator in the stack, which doesn't satisfy the 4th condition of algorithm. So, the * operator will also be moved to stack. I hope your doubt is cleared now.

[@ynimation787]

@@turtle164 oh!!!!.....thank you priya 👍☺️

[@turtle164]

@@ynimation787 🤗no mention

[@mohanapriya1336]

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

[@mgatech]

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

[@abdelmalek9004]

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 ?

[@aliefendi4653]

how are we going to do sinus function

[@LiPuN-ul2oc]

thank thank you sir your are the best

[@komalchakradhar9272]

hw dena ka tarika thoda casual hai🙂

[@madhusudhantd6256]

Really explaination is very clear and I love it

[@RajuRaju-kh8ke]

854^2+*62^93*/-

[@saniyamansuri9607]

Plz do mention the answers of asked questions.

[@galihtanu]

Thanks sir greeting from Indonesia. 😃

[@dipeshsamrawat7957]

I love Neso Academy. ❤️

[@gudduvindhyaa5295]

Awesome channel ☺️

[@kashishGoyal6250]

8*54^2+62^9/3*-

[@Shanmukh007-v3p]

No it's 854^2+*62^93*/-

[@neko_S8]

Thank you so much :)

[@sumanthsure4906]

Ans: 8542+^*62^93*/-

[@vedikamishra009]

galat

[@rakeshraki5426]

wrong

[@md.abdullahhimel]

Great work!! Many many thanks bro......!🫡