That's How Kabir Singh Performs Stack In Real Life!!!!!😁🤷♂️
Lec-30: Introduction to Stack | PUSH and POP operations | Data Structure
3.3 Push Operation on Stack | Insertion
3.2 Implementation of Stack using Array | Data Structure and Algorithm Tutorials
operations on stack|| what is meaning of push and pop? 🤔🤔#datastructure
Implementation of push()👨💻
Stack Data Structure And Operations | C Programming Example
Stack operations (push and pop)
What is stack in DS?|Operations on stack|Push & Pop algorithm|Creative Notes #notes#stack#ds
Stack Operations Explained 🥞 | Push, Pop, Peek & More with Visuals |#vilearnx
Stack Operations : Push and Pop Part 1 Explained in Hindi l Data Structure
Lec-31: PUSH operation using Array | Implementation of Stack | Data Structure
Stack | Introduction | operations on stack | push | pop | peek
Stack push and pop working
Stack of 8051 Microcontroller Explained: PUSH and POP Instructions, Working, and Program
Комментарии
Thanks sir apne bhut ache se smjha Diya ❤❤❤❤
mehakdeepkaur
राधे कृष्णा जी ❤ गौ माता जी सदा जय ❤❤❤❤❤
अभयदीप-जग
easiest is the best i am soo confuesd about algo until i saw this video my exam starts in 1hr and this is gen channel
spraygod
Absolutely awesome playlist but there missing some data structure i-e tree data structure which is also one of the most important concept in DSA.
It will be beneficial if you make a video on that so it will be helpful for upcoming generation to access a complete playlist from a mentor like you🤗⭐
Thanks😊
sayamuddin
sir tommorow is my exam but now my preparation is complete because of you
sam-vy
Thank you aap ne kaafi essay language may expalin kra 😊🙏💯
sakshimathur
Namaskar sir..,
I never thought this will help me the previous night before exam..i saw many tutorials but this helps me a lot truly..
Thank You
Love From Bangladesh 🇧🇩
nabbosarker
Here's a simple algorithm for inserting an element into a stack using if-else statements. This algorithm assumes that the stack has a maximum size and checks if there's space available before inserting the element.
1. Start
2. Define the stack (an array or list) and its maximum size (let's call it `maxSize`).
3. Initialize a variable `top` to -1 (this will track the index of the top element in the stack).
4. Function to insert an element (let's call it `push(element)`):
- If `top` is less than `maxSize - 1`, then:
- Increment `top` by 1.
- Insert `element` at `stack[top]`.
- Print "Element inserted."
- Else:
- Print "Stack Overflow! Cannot insert element."
5. End Function
6. End
This algorithm checks if there's space in the stack before inserting the new element. If the stack is full, it prevents the insertion and informs the user about the overflow condition.
AnjaliGarg-zo
I need your help about queues algorithm
zaibefi
Love from bangladesh, , , I did not understand the algorithm in class, I understood after watching your video
ara
Way of teaching is Great!! I could easily get a grip on the concepts!!
kinzaahmed
Sir for 6marks in exam this much is enough ha sir for both push and pop operation
Darshan.DP
You helped me alot
Thank you so much brother
zaibefi
thank you so much sir this video is really helpful.
Codelikepro
Very nice sir ... Sach m
Tq so much sir
jasmeetkour
sir mery liye ye topic buhot he difficult l ta but apka ye video dek kr entahy easy hugya
knowledgehub-xeey
Can I write step two in pop opretion like - set stack[top]=delete ?
mujthabamk
Sir, For POP operation :
Step 2: "Stack [Top]= Data/ Item" hoga otherwise it print "Stack underflow please response...?
mirajscreation
Sir various types operation ke question me je answer likh sakte hai
ThindThind
Sir thank you so much ...it was very helpful ..thank you