Here is an infix expression:
4 + 3*(6*3-12)
Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?
For the above question, did Bhaiya teach any concept? If yes, please tell what is the name of the lecture.
Hi… these are infix, postfix, prefix conversion ques… ig they are not given in the course contents… u study them from gfg… it would hardly take any time to understand these concepts… they are simply stack implementations…
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.