Thats really great to know buddy🙏 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
OH MY GOD! THANK YOU SIR ! THERE IS NO WORD TO DESCRIBE MY HAPPINESS WHEN I FOUND THIS CHANNEL xD. and they say watching youtube everyday wont get me anywhere
Thats really great to know buddy🙏 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
First you explain better than some people Second my professor don't want to help me code this he is saying it is your own work He just explain the idea and I should write the code Well, I'm learning that's why you should help me Maybe I'm wrong, maybe
You are right. That's why in my tutorials I cover both theory and practical part and provide both theory & full code on our website. Anyone can simply use the code to run on their system to understand the working. And also use the theory to prepare notes. As a beginner even I used to struggle with DSA hence I know what is needed by students 🤟😊
Thanks a ton bro.....I am eagerly waiting to write it...... It takes lot of efforts to make such types of content 🔥🔥🔥🔥🔥👌 Finally code executed.... Credit goes to u bro👍👌
bhai lots of thankyou I am watching your videos from starting, you are only the one who can understand students pain And your are teaching end to end #making skillest YOU MADE ME ZERO TO HERO IN PROGRAMMING proud of u bhai peace
Thanks buddy, I am really glad to hear that my videos have made these topics easy for you. Please do share the videos with your friends too & I hope you have subscribed. Thats the biggest help and support you can provide ✌
The link of this video was provided in our university’s presentation lecture. We were guided to have an understanding of Infix to Postfix and Infix to Prefix Conversion. That’s how I got this video. You did a great job in easy and understandable way that your video is suggested at university level. Applause for your work. Thankful to UA-cam as well to be the platform of quality educational videos.
Bro I have one doubt if precedence is equal say for (eg:consider + is in top and - is incoming)then we need to pop the top of the stack(+) and whether we need to push( -)or we need to check with new top ??
it doesn't work for me ... i had changed a little bit of this code. my teacher said not to make a peek function (one function in which we can see the top value) so i directly poped the value then pushed it back but still my output gives only the first operator and literally nothing else .. just a plus sign and nothing. what do i do ?
Check the code I have shared in the video description, cross check it with your code and see where you have made the mistake. seems like a silly if else mistake to me. ✌
advertisement - learning data structure and algorithm is difficult
tanmay : hold my beer😂😂
😂🙏😁
@@SimpleSnippets bro i have seen 4 episodes of harshad.
in explaining and implementation of data structures you are vuska ka baaap
No, no one cares ✌️😂
@@SimpleSnippets Why do You create Satck with Class if it could be made by keyword stack
This video proved to be extremely helpful to me.. Thank you so much.. More power to you
Thats really great to know buddy🙏 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
OH MY GOD! THANK YOU SIR ! THERE IS NO WORD TO DESCRIBE MY HAPPINESS WHEN I FOUND THIS CHANNEL xD. and they say watching youtube everyday wont get me anywhere
One of the best video explanation I have ever watched.
Really helpful.
Glad to know ☺️
The best guy. The best tutor. The best. Best best
best c++ channel on youtube
Thats really great to know buddy🙏 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
First you explain better than some people
Second my professor don't want to help me code this he is saying it is your own work
He just explain the idea and I should write the code
Well, I'm learning that's why you should help me
Maybe I'm wrong, maybe
You are right. That's why in my tutorials I cover both theory and practical part and provide both theory & full code on our website. Anyone can simply use the code to run on their system to understand the working. And also use the theory to prepare notes. As a beginner even I used to struggle with DSA hence I know what is needed by students 🤟😊
Thanks a ton bro.....I am eagerly waiting to write it......
It takes lot of efforts to make such types of content 🔥🔥🔥🔥🔥👌
Finally code executed.... Credit goes to u bro👍👌
Thanks a lot bro 🙏🙏
It was of great help.... 🙏
Thank God i found your channel 😍
Awesome explanation 🙃
bhai lots of thankyou
I am watching your videos from starting, you are only the one who can understand students pain
And your are teaching end to end #making skillest
YOU MADE ME ZERO TO HERO IN PROGRAMMING
proud of u bhai
peace
Thanks buddy, I am really glad to hear that my videos have made these topics easy for you. Please do share the videos with your friends too & I hope you have subscribed. Thats the biggest help and support you can provide ✌
Thank you so much mr. its an excellente code for learn something about postfix expressions.
I see you web and is awesome!!
this video help me so much in my assignment thank you so much
The link of this video was provided in our university’s presentation lecture. We were guided to have an understanding of Infix to Postfix and Infix to Prefix Conversion. That’s how I got this video. You did a great job in easy and understandable way that your video is suggested at university level. Applause for your work. Thankful to UA-cam as well to be the platform of quality educational videos.
Thank you for such wonderful feedback and I'm glad my videos are helping students 😌
May I know which University is this?
@@SimpleSnippets Capital University of Science and Technology(CUST), Islamabad, Pakistan.
UNDERSTOOD BOSS THANKS ALOT OF SUCH AN EFFORT FOR US REGARDLESS OF ANY REWARD.
☺️❤️
A very helpful lecture i found ✌God bless you Sir😄
I just say you are amazing bro! really amazing
Thank you so much 😀
Thank you 👍Very useful 😁
Thanks for guidance. Moreover, please also update, If expression contains any digit or numerical value, as currently this program not work for it...!
U give the best explanation !
Can you make video without using stack and using pop and push functions
brother, I think line no 21 there will be '||' operator because there may be 2 parenthesis sets
I'm getting a segfault in this while loop and I'm not sure why.
I have a question. If an expression contains integer along side variables. Then how to store that integer.
E.g A=B=4.
Bro I have one doubt if precedence is equal say for (eg:consider + is in top and - is incoming)then we need to pop the top of the stack(+) and whether we need to push( -)or we need to check with new top ??
Thank you for the help!
What if we want to put spaces between each operand and operator? How do we do that?
Example: 5 + 6 * 3
postfix+=temp; ke bad postfix+=" " lagado jit
It shouldn't matter. The program will ignore spaces, regardless.
it doesn't work for me ... i had changed a little bit of this code. my teacher said not to make a peek function (one function in which we can see the top value) so i directly poped the value then pushed it back but still my output gives only the first operator and literally nothing else .. just a plus sign and nothing. what do i do ?
thank you bro you are the best
plz tell me if we use numbers in infix expression to convert into postfix instead of using alphabets then what the code will be.
example: 4+10-9
store numbers as character e.g. operand will be greater than 0 and less than or equal to 9
very nice keep it up...
Thanks buddy, please do share the videos with your friends too & I hope you have subscribed. Thats the biggest help and support you can provide ✌
Thank you very much!
Why do we create stack with class in your tutorial when it could be done in one keyword
Because colleges demand us to manually implement stack
Bhaiya can you make one playlist on Linux based systems
How to operate it and perform different functions on it
Any video of infix to prefix with c++ program
Coming up soon in the next few days 🤟
excellent video
Thank you very much!
stack was unable to open what to do
I tried same code but for
input a+b-c
Out put is +a-bc
Please help
Check the code I have shared in the video description, cross check it with your code and see where you have made the mistake. seems like a silly if else mistake to me. ✌
@@SimpleSnippets it worked i did a mistake
Oh that's great. What was the mistake though? Sometimes we do silly mistakes and they are actually harder to find compared to syntax errors 😅
@@SimpleSnippets by mistake I used ' or ' and ' != ' In operator checking function
Can you explain this using array please
Sirji code wali link nahi khul rahi.....
here is one mistake......when we have same precedence then first pop that value in the stack then push the value..........but u said is wrong
I am getting error as what() bad_alloc how can i handle it
can you plz tell if we use numbers in infix expression to convert into postfix instead of using alphabets then what the code will be.
example: 4+10-9
Good 👍👍👍😎
nice video
Thanks Dear brother
Most welcome buddy ✌
Why have nt you made lectures on graphs? It would be really great If u made on em too sir. Thanks🙃
Will do soon
It was helpful but you could have explained the code with a sample expression. that would've been better.
thanks a lot
Glad it was helpful! Please do share this video with your friends too buddy & please Subscribe. Thats the biggest help ✌
Can you send me this program right now ??? Plz
y bhut bda h type krne m
If u have
Peace :)
great video