00:01
Hello student here the infix notation is given to us.
00:04
Now i have to convert this infix notation convert into prefix notation postfix not prefix postfix expression.
00:23
So how we will do this? first here take one stack and second is q.
00:32
So here this q and this stack.
00:37
So with the help of this q and with the help of this stack implementation will be done.
00:44
So all the operator will go into the stack and all the operand will go into the queue.
00:49
So first i will take a.
00:52
Now first i will take the bracket opening bracket here.
00:56
Now after this operand a will go into the stack.
01:01
Now multiplication operator now operand b after this plus but here what i find first this having the high precedence over the multiplication.
01:17
So here it will be added into the queue.
01:20
So now stack will be like this here opening bracket and here plus will come.
01:28
So this plus will now come here and after this my a will go into the queue.
01:37
Now after this again multiplication operator and after this my c.
01:45
Now plus and multiplication having the high precedence of multiplication will come here.
01:53
Now this multiplication i have taken from here and now my stack will look like this opening bracket and then plus and after this closing.
02:07
When closing will be encountered then i have to look for the i have to go back and look for the operator here and then discard.
02:18
So now with this one part after this i have to sold the bracket part again.
02:25
Now again my stack will carry opening bracket after this this d will be here.
02:37
Now i put the d here now minus sign will become here and here my e will become here.
02:48
So before this there is a division sign also.
02:52
So we just a minute for before this there is a division sign.
02:58
So for division sign this one...