Infix to Prefix conversion | Using stack | Data Structure & Algorithm | Bangla Tutorial

preview_player
Показать описание
In this video i have discussed the conversion of infix to prefix using stack in data structure.

you may contact via mail/skype/whatsapp:

whatsapp: 01771432336
Рекомендации по теме
Комментарии
Автор

আপনি অনেক ভাল বুঝান ! কিপ ইট আপ ! এক্সাম এর আগে ভিডিওজ গুলো আছে বলেই বাঁচলাম !

anannyarahman
Автор

apni bollen same preference hole insert kora jabe na, pop kora lagbe tahole 6:24 a ki korlen ? + agey theke thakle - kivabe push kora jai ?

sabbirharun
Автор

Mesmerising sir❤❤please keep continuing this series

sajadulislamdipu
Автор

Prefix : -*A^BC+D/E/F+GH
I think this should be the answer of this problem. Can you please check this...

mosabbirtarek
Автор

Writting need to be more transparent and understandable. Else you are a good tutor. Keep it up.

khokanmahmud
Автор

first bracket er por + asar tym kno pop krlen nh?

tassieee
Автор

Apnar Vul hoise
Answer hobe= H G + F / E / D + C B ^ A * -

AI diye check korte paren

pappusuperi
Автор

Translate each infix expression into its equivalent prefix and postfix
expression.
iv)
(A+B) / (D-C) ;
v)
(A+BꜛD)/(E-F)+G ;
vi)
A *(B+D)/E-F*(G+H/k)
Consider the following infix expression
Vaiya aitar solution ki deta paben

finemia
Автор

I will be very grateful to you if you give me the solution to convert Postfix {a b c / d c + * + f -} to Infix {...???...}expression. I also message it in your in Advance.

rayhannur
visit shbcf.ru