Postfix to Prefix Conversion & vice versa MANUAL conversion (6 Solved Examples) | Data Structures

Support Simple Snippets by Donations -
--------------------------------------------------------------------------------------------- In this tutorial we will learn to convert an postfix expression to a prefix expression and reverse process without using stack data structure in a manual way. We will solve 3 examples each for prefix to postfix and postfix to prefix 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 -

#postfix #prefix #stackapplication

[GodD.Immortal]

Now I can do conversions within the seconds 😄 all because of you
Thank you so much 😊❤❤

[parasgarg]

For both we have to scan left to right?

[amishibansal]

if we convert an infix expression to its postfix and prefix expression we get a different result in comparison to what we get from directly converting a prefix to postfix or vice versa. for example- if we convert a-b+c to postfix it is ab-c+ and it's prefix is -a+bc but if we directly convert ab-c+ to prefix we get +-abc which is different from the original prefix expression.... Y? can u explain. i'm very confused

[santhosh]

I was looking for this... Before this I've used expression tree to convert prefix to postfix... But this is quite simple and fast approach...thanks man...😇

[asldfkhjaslk]

Really hope to learn the concepts of Hash Maps as well

[asldfkhjaslk]

Is the series over or are you still making more content after Delete Node operation in Binary Search tree?

[absolutmadlad]

🖤 op channel keep them coming
Waiting for Tree and Graphs tutorials though 😅

[yatinbajaj]

++A-*$BCD/+EF*GHI ye solve nahi ho raha isse
help karo na....

[rajeshranjan]

please upload videos in Trees and Heap.