Lec-39: Infix to Prefix conversion using Stack | Data Structure

preview_player
Показать описание

0:00 - Introduction
0:46 -Infix expression
1:08 -Reverse Infix expression
2:29 -Reverse expression to Postfix expression using Stack
3:11 -Reverse the Postfix expression
3:38 -Example
8:52 -Final result in Prefix expression
9:05 -Time Complexity O(n)

►Data Structure (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Design and Analysis of algorithms (DAA) (Complete Playlist):
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Рекомендации по теме
Комментарии
Автор

अध्यापिका जी आप बहुत अच्छा padhaati हैं और हम चाहेंगे की आप ऐसे ही आगे और padhaati रहे | ❤️😊👍🏻

Manas.
Автор

Thank you so much Mam and team of Gate smasher For your best Course ❤❤❤

navedpinjari
Автор

Mam aap prefix me convert karwa rhi ho ya postfix me

rohitkumarsahu
Автор

I have question and it is A[B+C(D-E)*F]^G

JagdishOnYT
Автор

mam you are very cute your speaking is cute 😘 so I can't focus on study varun sir is best for me

tharabhai
Автор

You are more beautiful than Kylie Jenner

kcuf
Автор

Wrong hai half the postfix expression you derived is not postfix it is reversed prefix

ntlaveen
Автор

Please create video on a
Evaluation of Postfix Expression on stack

prajwal
Автор

I saw many videos but this video cover all my doubt, such a Great video 👍

priyankamali
Автор

Mam searching or sorting topic ke pseudo code pr video dalo plzz

aaditichumbhale
Автор

Your tutorial is really useful. Thank you for uploading it सर plz आपके चैनल मे कई play list अधूरी है कृपया इन्हे कंप्लीट करे thank for all video

chandrashekhar
Автор

awesome explanation but white ki jagah blackboard hota to jyada acha rhta

ayushsuryawanshi
Автор

Hello Mam,
Your & Varun Sir teaching style is very unique & appreciatable. You have made Data Structure topic very easy to understand. A request to you mam, please make complete playlist on Data Structure Various Topics.
Lots of Love from PAKISTAN

aamirakhunzadaTanoli
Автор

Well explained madam. However, there is one thing you can update.
For example, infix = d/c*b => prefix = */dcb, right? It will not come with the procedure mentioned above (it would come as /d*bc, right? which is not correct). So, my humble suggestion to you to pop the operator at the top only when it is higher (not equal) than the operator encountered; if they are of equal precedence, do not remove the top operator, just push the operator encountered, i.e., keep them both.

sumantachakraborty
Автор

oh udta punjab, turan turan tun turan turan tun, oh udta punjab

abdullahleo
Автор

mam i search this topic everywhere but i cant understand easily but you explained this topic in a vey easy and understable manner and made this topic very easy for me. thank you mam☺

PrekshaJain-pvnz
Автор

(A+B)*C-D+E^(P-F) infix to prefix, Please solve this question mam (Through manually and stack)

DiwakarKumar-kf
Автор

mam queues ka video bna do mam mera put hone vala h 16 se

amit_mishra__
Автор

I am from Pakistan comsats university.... this vedio help me a lot for my exams .. thanks Teacher ❤

rajadanish-icne
Автор

mam linked data structure par or video daliye plz mam searching and shorting par par video daliye mam plz plz plz plz 🙏🙏🙏🙏🙏🙏🙏

Code_wale_Bhaiya
welcome to shbcf.ru