3.6 Infix to Postfix using Stack | Data Structures Tutorials

you are the best datastructure teacher i've ever seen, because u teach really well and selects EXCELLENT quetions which has all the possibilities/outcomes , so i hv zero doubts in the end

I'm watching this video because of your voice mam
Your voice is Soo amazing

thank you so much. Your videos are the best👍👍👍👍

Miss love you

In C language, there is no exponent operator
^ : this is an XOR operator and not an exponent operator.
The precedence of bitwise XOR is less than the precedence of parenthesis, addition, subtraction, multiplication, etc.
Please correct this in the lecture

🤩 end of college semester i cleared my this topic concept...

Highly recommended video......Very informative.......

Jenny i am grateful you're alive❤❤

Thanks mam g today is my exam I'll watching this video before the exam

20 min before exam i am seeing your video mam 🎉

You teach so good!

👑👑👑

A QUEEN

Thnku❤

Love You Jenny Mam

Instead of using array, we can also use linked list to implement stack. Linked list allocates the memory dynamically. However, time complexity in both the scenario is same for all the operations i.e. push, pop and peek.

In linked list implementation of stack, the nodes are maintained non-contiguously in the memory. Each node contains a pointer to its immediate successor node in the stack. Stack is said to be overflown if the space left in the memory heap is not enough to create a node.

Algorithm

STEP 1: IF HEAD = NULL
WRITE UNDERFLOW
GOTO STEP 6
STEP 2: SET PTR = HEAD
STEP 3: SET HEAD = HEAD → NEXT
STEP 4: SET HEAD → PREV = NULL
STEP 5: FREE PTR
STEP 6: EXIT

Too long question

postfix expression :-

KL+MN*-OP^W*U/V/T*+QJA^^+

thank you Jenny ma'am for such a wonderful explanation

Mam
Doubt 1:
O ^ P means O Bitwise XOR P... And bitwise operators are left to right associative, but you have explained here as right to left....

Mam
Doubt 2:
if this caret symbol ^ is meant to be the Exponentiation then associativity of exponent is R to L, in that case your lecture is clear.

But for this case kindly tell me priority of exponent or caret and unary operator in c.

Thank you mam

Associativity kya hota hai?

What if after the opening brace there is (^/*+-) then how we'll organize it

Teacher be like Jenny ma'am

Kya video banaya hai ma'am ek baar mai hi aa gaya

Plz explain the code for infix to prefix and postfix

how the associavity is to be known like from infix to prefix whenever operators + and - occured associvity was from right to left and in this vdo it is from left to right ??

thank you mamm......................

KL+MN*-OP^W*U/V/T*+QJA^^+ mam as u said that associativity of^ is from right to left check the exp which I have written is correct??? Thank u for this video it was very helpful for me. I appreciate your work ...

how is associativity left to right?

please write with black marker red is not much visble

Love u jenny

mam i was taught that two same priority operators cannot be together in a stack just like that ...but u only explained abt associativity...Thank you so much mam !

mam can i use rules as an algorithms

I am here from jobless guy ❤

Hell yeah gotcha ma'am.. thank you 🎉

Super explanation mam

Tq mam

Super teaching mam❤

Thank you so much mam🥰 lots of love❤️❤️

Love from afganistan ❤.

Mam ^ associative is left to right

9.36 anyone notice voice now

Which state mam...uuuu❤

Excellent work very detailing

I lo yo

Madam, your videos are very very helful, thanks👍👍👍

Really its very helpful..student of nielit a level