Array Implementation of Stacks (Part 2)
ฝัง
- เผยแพร่เมื่อ 25 ส.ค. 2024
- Data Structures: Array Implementation of Stacks (Part 2)
Topics discussed:
1) C program to push an element onto the stack.
Data Structures: bit.ly/3hjudFV
C Programming: goo.gl/7Eh2SS
Follow Neso Academy on Instagram: @nesoacademy(bit.ly/2XP63OE)
Follow me on Instagram: @jaspreetedu(bit.ly/2YX26E5)
Contribute: www.nesoacademy...
Memberships: bit.ly/2U7YSPI
Books: www.nesoacademy...
Website ► www.nesoacademy...
Forum ► forum.nesoacade...
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#DataStructuresByNeso #DataStructures #Stacks #ArrayImplementationOfStacks
😢I have now words sir,your lecture is very very very veryyyyyy helpful..I am realising from my experience that you are the best teacher in TH-cam 😢Your videos are so different and sparks the brain 😮
Thank you Neso Academy. sir please try to give us the whole data structure part as soon as possible🙏
do you got placed brother ?
You saved my ass for my 1st data structures test. Will be referring to the whole course till my finals. Kudos for this great content..
I wish I have teachers like you in my college
Heyy!! Plzz continue the series🙏🙏
It's saving many of us
Since that, we increment first then assign, we can:
void push(int data)
{
if (top == MAX-1)
{
puts("Stack is full");
return;
}
stack[++top] = data;
return;
}
👍
@@chakradharthota1100 yeahh nice idea!
Thank You So much @NesoAcademy to make DS very easy to understand. Waiting for upcoming videos.
Do you got placed??
Excellent sir. Your voice gives enthusiasm in us. Please do more videos.
Very beneficial as usual ... so many thanks
Best teacher for Datastructures and Algo ever . Can you please make videos on sliding window max sum problems . Sliding window first negative num please .
Thank u 🥺, plz upload more videos asap
Thank you Neso Academy
this channel is on god level
sir, it's Epic explanation that u r doing please continue Full DSA 🙏
how simple way you explain this .thank you so much sir, keep making such videos
Thank You sir your lectures help us a lot. Thank You
Nice explanation
I have learned this
This is very helpful...! Thanks #Neso Academy😊
I love Neso Academy :)
Thanks I was waiting for this
Sir you are so easy to understand
Thank you so much
Thank you So much i like the way of yours teaching you just make any c problem simple
I will stop paying my college fees and come to your house everyday
That's called as tresspasing bro it is not legal = ) LOL
Really 🤯
Plz upload every day one lecture 🙏🙏
Nice explanation
Music: Axol x Alex Skrindo - You [NCS Release]!!!!!!Nice song
Can anyone plz tell for the push(4) the top is 3 so why 4 gets store in the stack and for push (5) the top is 4 and therefore it is not stored in stack but the condition is top = 3 so push(4) also should not get stored in stack ?
Ayyo Damnn, i had the same question, but i realized, At push(4), the top is still 2, cuz the the line "top = top + 1" isn't executed yet. the "If" condition is ran first, so at that point top is still 2, then later, when the if condition is false, it then becomes 3
thnk you Neso Acadmey its helpful the most☺☺
great, i learn alot from this video. very good explanation.
Good 👍👍👍
It's such an amazing lecture, sir .. That's absolutely point to point ..
Huge of respect from ladakh india..:-)
sir's voice texture is amzing
Sir you are great but plz queues wale videos bhi youtube per free m upload kar do plz sir 😢
Thank you Neso Academy!! nice explanation but some videos like file handling in c are paid make that free on youtube.....lol😂
Thank you Sir g wo explaining in detail 🙏💕🎉💗✅💯👑😘😍😁
Sir Top < Max bhi kar skte hai?
This is how Stack Overflow was created
Thankyou so much sir😃
Sir please upload lectures fast.
Bro , make a video to implement stack using linked list
sir complete the whole data structure asap sems are coming.
I wil refer your channel for my lifetime 😢🎉🎉🎉🎉🎉
8:35 return keyword
Sir you are not uploading lectures in neso app..please upload in that and also continue the discrete maths course
Hey Badge99 😉
I wish you made a video on DSA in python
Please sir data structures syllabus complete videos upload as soon as possible please sir
After executing this code in vs code ,. We are getting message 4 time stack overflow
Since the program works only if we give numbers like 1,2,3,4 .
What if we give numbers like 23 , 45 , 67, 89
plz make tutorials on spring
Class of this course🙌
how long is this video lectures going to be?
A rough idea please anyone?
sir i have a doubt
is this possible to write like this
in the push function if(top==max)
then stack over flow occurs
No that wont work as max=4
And as stack starts from 0 the positions are 0 1 2 3 so top will never be equal to max which is 4
thank you very much sir for this palylsit that very thankful you to for explain in very easy way
Bro where is the function declaration 😢 plz reply
Sir isko local variable kese krte hajn
7:20
where is the notes
❤️❤️❤️❤️❤️
❤
👌👌👌👌👌👌
👍
3 hours lecture in 11 minutes
mera error ara hai int [data]me
#include
#include
#define max 10
int stack [max],top=-1;
void create();
void pop ( );
void peep();
void push();
int main()
{
int ch=1;
int i;
for (i=0; i=1&&ch0; i--)
printf("%d", stack [i]);
}
Why my code is not working please anybody find out the mistake