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

Support Simple Snippets by Donations -
Google Pay UPI ID - tanmaysakpal11@okicici
PayPal - paypal.me/tanmaysakpal11
--------------------------------------------------------------------------------------------- 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.
Theory & Code article - simplesnippets...
Full DSA playlist - • Introduction to Data S...
C++ Programming Tutorials for Beginners Course - • Introduction to Comput...
Simple Snippets Official Website -
simplesnippets....
Simple Snippets on Facebook -
/ simplesnippets
Simple Snippets on Instagram -
/ simplesnippets
Simple Snippets on Twitter -
/ simplesnippet
Simple Snippets Google Plus Page -
plus.google.co...
Simple Snippets email ID -
[e-mail]
For More Technology News, Latest Updates and Blog articles visit our Official Website - simplesnippets....

[@jaydeeppande376]

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 😇

[@cyrusren7260]

yes i do get it. i thought i am the odd one out only.

[@BlinkCodee]

Plot twist :tanmay was checking whether ur studying Or not

[@Sci-Fun-tist]

ye har vid me esa hta hai inki but still okayy good work

[@mairajahmed7873]

thank u for comment i was get confused over there

[@sanketsonje8290]

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

[@zainabbohra2915]

is BC^A+D*E+ is same as you written

[@antounshahin497]

AWESOMEEEEEEE !!! 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

[@antounshahin497]

I am sorry for complaining but also at 16:30 when we get to (ax1d*e+) you forgot the addition operation after the (ax1) expression

[@SimpleSnippets]

yes that was a silly mistake from my side. I am glad that you figured it out which means you were paying good attention ✌

[@arslanshahid360]

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

[@SimpleSnippets]

Thank you Arslan Bhai 😇 itna pyaar and support aapka rahega toh aur Kya chahiye ✌️ Congratulations on clearing the course too bro 🤟

[@hilarybailey4115]

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

[@amruthachitluri4419]

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

[@abhimannyumagar1033]

Correct

[@sourabhsivare1876]

(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.

[@rehansyed4247]

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😍

[@SimpleSnippets]

Hello Rehan, most welcome bro I am very happy to hear that you cleared DSA. Thank you for such wonderful feedback too. Please do share the videos with your friends too. Thats the best help and support :-)

[@anushyasenthilkumar2508]

Super

[@expert77]

Nice explanation ❤

[@sathwikshetty917]

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

[@aayushithakur3041]

Thanks a lot. these are life saving

[@ruchithahs5517]

Helped me a lot when needed in hurry tqsm

[@androidking8158]

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

[@Arigatohk-mj2bq]

Thanks for the video. It was of great help.

[@saurabhpandey2018]

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

[@jessicagiron3804]

thank you sir!

[@hrushikeshwasamkar2423]

I love the way you explain !! Thanks a lot

[@SimpleSnippets]

Glad to know this buddy. Thanks for all the lovely compliments. Please support me by sharing the videos and our channel with your friends too🤟

[@hrushikeshwasamkar2423]

@@SimpleSnippets offcourse , I really want to grow your channel , you definitely deserves more views and subscribers .

[@harshdasila6680]

too good explanation

[@vickyprajapat304]

Thank you sir u explain amazingly

[@umarajmal6216]

Great explanation !!

[@saahildharmaji7512]

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

[@hareshparab7808]

thanks bro

[@Your_Boy_Suraj]

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

[@SimpleSnippets]

Filal DSA course chalu hai Suraj, competitive programming ke liye one of the most important subject hai ye. DSA - Dats structures and algorithms. C++ main hi practical part hai toh ye pura playlist aap check kar lo channel par ✌

[@Your_Boy_Suraj]

@@SimpleSnippets after watching all the tutorials only I am asking.. In DSA playlist I am finding Linked List implementation part bit hard to understand. Please make part 2 for it. If possible go for STL concepts also. Waise sir DSA me abhi kitne videos aur aayengi..?

[@ombothe5885]

Awesome

[@kainatkhan4863]

Awesome vedio ✅💯✅💯✅

[@nitishpankaj209]

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

[@SimpleSnippets]

Next video is introduction to trees. Already done recording, editing is left so ASAP

[@vithunchandra8420]

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

[@varun_tech7]

well another great video ...thumbs up brooo

[@SimpleSnippets]

Thank you for such wonderful feedback Varun. Please do share the videos with your friends too. Thats the best help and support :-)

[@kainatkhan4863]

Wow 👌🏻👌🏻👌🏻👌🏻👌🏻👌🏻

[@tejasdhadve2782]

Hello, sir your webiste is not showing anything, it is just showing sample page when i am clicking on it.

[@SimpleSnippets]

Its fixed. There was some issues

[@sachindewangan6378]

At 15:57 you wrote X2=AX1, that should be AX1+

[@aishwaryapujari2013]

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

[@exp_with_Vishal]

can u plz give us more ques to practice plz

[@saipavankumark985]

bro in exam we can write same example that assigning to x1,x2,x3

[@SimpleSnippets]

Yes you can ✌️

[@pranayhusukale2666]

1st like without even watching

[@SimpleSnippets]

Pranay bhai aise matt karo, video dekh bhi lo, bas like karke chodogey toh that kinda gives a negative impression to googles ranking algorithm :-)

[@lorddani7300]

i think u forgot to add + after AX1 at 15:56.

[@SimpleSnippets]

Yeah silly mistake. Sorry for that but I am glad you noticed. That means you are paying proper attention 😉✌

[@lorddani7300]

@@SimpleSnippets hey man thanks for the nice videos my exam went real good all thanks to u

[@alphatanmoy14]

u missed the - XD @11:51

[@sachindewangan6378]

At 11:26 you forgot to add -

[@daiictupdates]

give algorithm for this

[@nikhilhinge4523]

Bhai 2nd question ka answer mein last - aata bhaii

[@sayfasayfa3500]

Ak program b samja do na bhai practical mai aatha hai

[@soumyadeeppaul7101]

Shortcut me5hod

[@debasishgoswami1791]

❤❤❤❤❤❤tq❤❤❤❤❤❤❤

[@harshshukla7260]

Awesome