Postfix to Prefix Conversion & vice versa MANUAL conversion (6 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 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.
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....
#postfix #prefix #stackapplication

[@GodD.Immortal]

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

[@SimpleSnippets]

Great job!

[@santhosh6784]

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

[@SimpleSnippets]

Glad it helped! Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇

[@santhosh6784]

@@SimpleSnippets Definitely bro...

[@muhammadbilalmalik7292]

Boht Hard Brother!!!!

[@SimpleSnippets]

Thank you bhaai 😇

[@asldfkhjaslk]

Really hope to learn the concepts of Hash Maps as well

[@SimpleSnippets]

Will cover soon

[@alloydsaviomendonca173]

@@SimpleSnippets yes please cover it up

[@yamilz32]

@@SimpleSnippets Subscribed waiting for that Hashing times.

[@sudheerm.s6792]

Really very valuable

[@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

[@absolutmadlad4941]

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

[@SimpleSnippets]

Thank you so much buddy, please do Subscribe to our channel as we have a lot tech educational content which you'll surely like. Also please do share our channel and videos with your friends too, that's the biggest help and support you can provide buddy ✌ & Yes Trees & graph topic will be covered very soon!

[@asldfkhjaslk]

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

[@SimpleSnippets]

I will! Lots to cover!

[@parasgarg8187]

For both we have to scan left to right?

[@_parthhhOP]

1:32

[@nagendrapp2213]

Osm

[@rajeshranjan6458]

please upload videos in Trees and Heap.

[@SimpleSnippets]

Yes Rajesh I will cover these topics soon 😇

[@rajeshranjan6458]

@@SimpleSnippets you are really doing a great job ,looking forward to see your upcoming videos 😍

[@yatinbajaj287]

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