Infix to Postfix Conversion & vice versa WITHOUT using Stack(With Solved Examples) | Data Structures

Support Simple Snippets by Donations -
--------------------------------------------------------------------------------------------- In this tutorial we will learn to convert an infix expression to a postfix expression without using stack data structure in a manual way. We will also learn to convert a postfix expression to infix expression. We will solve 3 examples each for infix to postfix and postfix to infix using manual steps.

Simple Snippets Official Website -
Simple Snippets on Facebook -
Simple Snippets on Instagram -
Simple Snippets on Twitter -
Simple Snippets Google Plus Page -
Simple Snippets email ID -

[jaydeeppande]

Sir at 11:58 the ans should be abc*+de/- You Forgot to put - there.... and at 16:55 ans should be ABC^+D*E+ ...thank you ur videos are really awesome I learnt a lot 😇

[sanketsonje]

at time17.02 of the video, answer of the postfix expression is ABC^+D*E+

[arslanshahid]

may nay course clear kr lya hai .. lkin phir bhi may ap ki vodeos ko watch time deta hun ta k aap bnaty rhen videos q k bhut acha parhaty hain aap

[antounshahin]

!!!
but just a note that when you got to the expression( x3x2-) in 12:00 and start going back to (ax1+de/-), you forgot to add the minus operator after the division operator

[amruthachitluri]

There are small mistakes in 2 places but the rest is fine! Nice explanation!!

[rehansyed]

Thanks you very much i cleared my data structures with your best tutorial thank for making understand. You make toughest to easiest thanks .
Keep doing it😍

[hilarybailey]

Please add the minus sign at log time12:46, ie. abc*+de/-. Great lesson!!!!

[Arigatohk-mjbq]

Thanks for the video. It was of great help.

[saurabhpandey]

Each and every words of yours is meaningful .
Along with dsa i am learning fluency in English too. 😜😜

[ruchithahs]

Helped me a lot when needed in hurry tqsm

[hrushikeshwasamkar]

I love the way you explain !! Thanks a lot

[varun_tech]

well another great video ...thumbs up brooo

[sathwikshetty]

For postfix to infix....even if u go with left to write u get same answer...but follow precedence while converting

[sourabhsivare]

(A+B^C)*D+E will be the proper answer because as we can see there is also '*' operator, which has higher precedence than '+' operator, yet it came first.

[nitishpankaj]

Sir, When will you upload trees and graph lecture? ?

[vithunchandra]

haha those mistake are on purpose to test our understanding about postfix and infix i think. nice explanation by the way

[aishwaryapujari]

In second example why don't u add '-' sign at last?

[Your_Boy_Suraj]

Bhaiya ab STL library ka bhi ek tutorial chalu kar dijiye.. Competitive programming me problem aa rahi hai thoda...!!!

[androidking]

I literally solved all of them without pen paper within 10 to 20 seconds....

[saahildharmaji]

Q2 answer is abc*+de/-
U have missed the " - " sign In the answer.
Even Q3 answer is abc^+d*e+.