Please Comment, Subscribe and Click Bell🔔🔔🔔 Icon for More Updates. To learn software course from our experts please register here for online training: goo.gl/HIB0wL
Sir seriously you have made my concept perfect.. Thank you so much i woul love to get train by you . My gmailid divyanshdixit@gmail.com sir please send your curriculum i called your no it was unreachable
But u r saying that it is impossible to delete any data from any memory location in any praogrammimg language So what is the role of (free) function in c we call that to delete the data from any memory location anf make that memory free
Finally i got the desired channel which will boost up my programming skills. Especially data structures. Thank you NARESH TECHNOLOGIES. It will be better if you make videos on Algorithms also.
27:46 is very important. It explains the meaning behind deletion in this example of stack. Also, use "return ele;" instead of "return top;" in int pop() function.
Sir , I am getting confusion at one point of this video for Push() function. actually you are getting the top value of stack into "ele" variable and you don't return the "ele" variable but you're returning the stack[top] at the last line. I think the "ele" variable have kept the Top value which need to be return from the Pop(). Please response me . Thanks for sharing this video. really I m very happy to see this video and I have learnt a lot from your video. you are doing good Job . we all are appreciating to you.
Now I can visualize the working of stack in my mind .... Thank You Sir !!
6 ปีที่แล้ว +21
Is it a correct understanding when you are popping an element, you are not removing it per se, you are just returning the element and moving top var one down, would it be a more proper way to set the value as zero or something? Otherwise thanks for an outstanding lectures
Yes, because this is static memory allocation. So, even if you pop an element, the memory space remains there. However, if it was a dynamic memory allocation we would've used realloc() to simply wipe out the memory space of the element we popped.
Here is the complete code for the whole video: #include #define CAPACITY 8 int stack[CAPACITY]; int top = -1; int isempty() { if(top == -1) return 1; else return 0; } int isfull() { if(top == CAPACITY-1) return 1; else return 0; } int peek() { return stack[top]; } int pop() { int ele; if(!isempty()) { ele = stack[top]; top = top - 1; return ele; } else { printf("Could not retrieve data, Stack is empty. "); } } int push(int ele) { if(!isfull()) { top = top + 1; stack[top] = ele; } else { printf("Could not insert data, Stack is full. "); } } int main() { // push items on to the stack push(10); push(9); push(8); push(7); push(6); push(5); printf("Element at top of the stack: %d " ,peek()); printf("Elements: "); // print stack data int i; for(i=0;i
At 24:41 we are returning top and when top=0 ( or if the element itself is 0(zero), and we are returning that element). Then in that case too there will a problem in the main function which thinks that the stack is empty.
So nicely explained by you sir that the doubt which arose in mind about deletion of element was cleared in the video itself as if you knew this is gonna happen somehow.
In pop() function you are returning the position. Not the element . if you are returning the position than what is the purpose of assigning the value to variable ele
Sir in pop () you returned top value instead of the deleted value that was stored in ele. I watched that part twice to make sure If I was mistaken but sir I think you wrote it by mistake. Correct me if Im wrong. Thankyou sir. You are a source of light to my darkness 🌟 Forever grateful.
Sir the thing is , in pop( ) ,you said if stack is empty it will return 1; and then after you concluded it with returning 0; i couldn't get that point clearly... please reply as soon as possible sir!
sir in case of pop , as you said earlier if there are elements in the stack should consider return 0 but you consider is empty as return 0 ,I thought you wrote by mistake sir can you please tell
Thank you so much for the whole data structure series. It's great stuff. I really like the outro music, can someone tell me the name of the music or a link to it, would be really helpful.
at 8:57 he says in dynamic memory allocation there is no memory to store further, but its dynamic it can increase its memory so how can be full. please answer.
While traversing, should the function return elements in LIFO order (as this is a stack) or FIFO order? Here FIFO is shown but LIFO is a better fit right?
Sir please help me out, In the pop() method the we are assinging the top element value to the variable "ele" { ele = stack[top] } , and after which we are reducing the top value but still the value that was previously was at top is not deleted [ i.e the value of "ele" is still in the array at top +1 position].
Please Comment, Subscribe and Click Bell🔔🔔🔔 Icon for More Updates. To learn software course from our experts please register here for online training: goo.gl/HIB0wL
Plz reply to my commnent
Thank you Sir for your depth knowledge
I have a question why in push function we are returning void and in pop function we are returning integer value
Sir seriously you have made my concept perfect.. Thank you so much i woul love to get train by you . My gmailid divyanshdixit@gmail.com sir please send your curriculum i called your no it was unreachable
Sir very nice concept
But u r saying that it is impossible to delete any data from any memory location in any praogrammimg language
So what is the role of (free) function in c we call that to delete the data from any memory location anf make that memory free
Finally i got the desired channel which will boost up my programming skills. Especially data structures. Thank you NARESH TECHNOLOGIES. It will be better if you make videos on Algorithms also.
NT's lecture is best please Alsoo watch
This lecture at once th-cam.com/video/4BDeAliHVgY/w-d-xo.html
@@bholaprasadyadav4396 Yes bro but it's private video so can't seeing.
@@ce13_piyushprajapati40
Sorry for this
Please visit this one
And send your feedback ✍️ th-cam.com/video/je1w27UKKs8/w-d-xo.html
27:46 is very important. It explains the meaning behind deletion in this example of stack.
Also, use "return ele;" instead of "return top;" in int pop() function.
Can you please tell me that which language he is using 'c' language or 'java' language ??
There's a small mistake there.....it should have been stack [top]...bcz top will give the index no not the element and yes return ele is correct
NT's lecture is best please Alsoo watch
This lecture at once th-cam.com/video/4BDeAliHVgY/w-d-xo.html
Exactly... I'm here in comment to right this😄
Correct, same observation 😊
The moment I struggle with any doubt, you clear my doubt then and there. You teach so well, Sir.
One of the best technical trainers I have ever listened to!!
I have been trying to understand stack for 3 years but failed.
Now I know the concept because of you.
Thank you very much
You are Best teacher sir
Keep going on because of i really interested in all programming knowledge thank you so much sir🙏🙏🙏🙏
For your lectures... 1M subs is not a matter 🙃i expect more than 5M❤️
I got chills the moment you said that when you try to add more data, the data in *that* location is overwritten
Finally sir I got best explanation of stack sir my all douts are clear sir related to how to implement of stack 👍
clear explanation.... after watching sir prgrm in naresh tech, i started loving prgrms... thanks ji..
Your great sir .....every point is important clean and clear explanation..thank you soo much
superb C master class worth every second.
We are in safe hands.
Srinivas sir is best for c language and DS in c language (as I have learned c from Srinivas sir and currently learning DS)
Thanku sir. Your series of videos is highly useful to learn the whole concept in a short time.
Sir , I am getting confusion at one point of this video for Push() function. actually you are getting the top value of stack into "ele" variable and you don't return the "ele" variable but you're returning the stack[top] at the last line. I think the "ele" variable have kept the Top value which need to be return from the Pop().
Please response me .
Thanks for sharing this video. really I m very happy to see this video and I have learnt a lot from your video. you are doing good Job . we all are appreciating to you.
wow .love you man... this content is awesome
super👏👏👏
thank you so much sir for this great explanation literally you cleared every question. thank you so much..
Great to understand the concept of memory deletion 🙂
What a explanation. Very simple and in deep.
Now I can visualize the working of stack in my mind .... Thank You Sir !!
Is it a correct understanding when you are popping an element, you are not removing it per se, you are just returning the element and moving top var one down, would it be a more proper way to set the value as zero or something?
Otherwise thanks for an outstanding lectures
Yes, because this is static memory allocation. So, even if you pop an element, the memory space remains there. However, if it was a dynamic memory allocation we would've used realloc() to simply wipe out the memory space of the element we popped.
@@TheIndianshowstopper So by wiping out with realloc(), you mean overwriting the memory space?
Here is the complete code for the whole video:
#include
#define CAPACITY 8
int stack[CAPACITY];
int top = -1;
int isempty() {
if(top == -1)
return 1;
else
return 0;
}
int isfull() {
if(top == CAPACITY-1)
return 1;
else
return 0;
}
int peek() {
return stack[top];
}
int pop() {
int ele;
if(!isempty()) {
ele = stack[top];
top = top - 1;
return ele;
} else {
printf("Could not retrieve data, Stack is empty.
");
}
}
int push(int ele) {
if(!isfull()) {
top = top + 1;
stack[top] = ele;
} else {
printf("Could not insert data, Stack is full.
");
}
}
int main() {
// push items on to the stack
push(10);
push(9);
push(8);
push(7);
push(6);
push(5);
printf("Element at top of the stack: %d
" ,peek());
printf("Elements:
");
// print stack data
int i;
for(i=0;i
Thanks a lot❤
Happy Belated Teacher's Day to you sir!!! Thank you for explaining so beautifully!
Superb explaination 👏👏👏
Nice explanation Sir 👌👌👌
your teaching is awesome sir 👍👍
Such a clear explanation!!!.....U got a subscriber today👍
At 24:41 we are returning top and when top=0 ( or if the element itself is 0(zero), and we are returning that element). Then in that case too there will a problem in the main function which thinks that the stack is empty.
Getting the knowledge in a rightfull way...#DATASTRUCTURE
Simply superb, clear and awesome explanation sir
i turn off my adblocker and watch lengthy annoying ads just to support your channel sir, thank you for your easy explanations!
wow ! excellent explanation sir, regarding the not deleting just not pointing it....
So nicely explained by you sir that the doubt which arose in mind about deletion of element was cleared in the video itself as if you knew this is gonna happen somehow.
You are Great Sir , Amazing Lecture ❤👌
Well explained specially about what exactly means to delete a data.
sir you are a great teacher.
Thank you for this wonderful lecture.
Thank you very much sir.. very. Good explanation.clear understanding..thank you
In pop() function you are returning the position. Not the element . if you are returning the position than what is the purpose of assigning the value to variable ele
thank you soooo much....understood very clearly....thank u soo much
Excellent teaching sir...god bless you...
You are absolutely great sir.
Brilliant explanation sir..thank you
naresh sir thank u very much for your online video studiz keepet up sir thnqs
Great explanation
Very nice and clear explanation sir
Awesome explanation
Big fan of You sir..
Great lecture thanks sir
HERE IS THE COMPLETE CODE FOR PUSH OPERATION:
#include
#define CAPACITY 8
int stack[CAPACITY];
int top=-1;
int isfull()
{
if(top==CAPACITY-1)
return 1;
else
return 0;
}
int push(int ele)
{
if(isfull())
{
printf("stack is full
");
}
else
{
top=top+1;
stack[top]=ele;
printf("elements are: %d
",ele);
}
}
int main()
{
push(10);
push(9);
push(8);
push(7);
push(6);
push(5);
push(4);
push(3);
push(2);
push(1);
return 0;
}
Sir in pop () you returned top value instead of the deleted value that was stored in ele.
I watched that part twice to make sure If I was mistaken but sir I think you wrote it by mistake.
Correct me if Im wrong.
Thankyou sir. You are a source of light to my darkness 🌟
Forever grateful.
Yes I think it should be ele instead of top
yha ur right it will return ele only, not top
Yes you are right, and along with that , the value at TOP isn't actually popped from the stack,we're just decrementing the TOP instead.
At what duration ?? Please mark
sir itne acche se toh cls m v nhi smjhte h .....thnq sir
Outstanding explanation Sir!
Thank you NARESH TECHNOLOGIES
In pop() function you are returning variable top instead of element. i think you should return ele. isn't it?
yes, element will be return.
27:00 please watch from here to clear why to return top.
Excellent explanation sir
Sir, in pop function , we have to return the "ele" na because ele is the top element and "top" is index
Right I was wondering the same....🙃
Thank you for the lecture..great work
Super explaination sir 👏👏👏
sir in pop() method you return top variable instead of ele variable...
yes arun is right Mr.shrinivasn, kindly take care of that
Totally awsomee sir
Wonderful.
Just great!!
void main()
{
int n;
printf("How Many Elements You want to store in array:");
scanf("%d",&n);
int a[n];
for(i=0;i
very nice explaination. thankyou sir
It's Amazing do watch it..
sir u r great
very healpfull video
Sir you are awesome..!
there is some logic missing like tracking of "top" value in traverse method..... remaining everything is awesome thanks for teaching us
Pls don't care about variables and follow the logic.
Yeah ok
Sir the thing is , in pop( ) ,you said if stack is empty it will return 1; and then after you concluded it with returning 0; i couldn't get that point clearly... please reply as soon as possible sir!
Sir pop() function should return top element(ele) instead of top variable. Am I right??
Sir we can use a variable inside of the big brackets of an array in C99. Such arrays are known as variable-length arrays.
I have a question about Peek, isn't it a bad thing to return 0 when the stack is empty? What if we could expect 0 as a legitimate value in the stack?
27:52 most important note
Concepts clear!!!
Thank you so much sir 🤗and please make a video on quick sort in data structures plz sir
Very nice explanation sir. thank you
Well explained sir....
put videos on all sorting methods which are present in datastructures
Sir I cannot thank you enough, would love to meet you sometime.
Sir can we reterive or recover that unpointed/garbage value if it's not overwritten by another new data? 28:00
Awesome sirjee hats off
Beautifully Explained !!!!!
Gr8 work SIR
sir your great.Thank you
sir in case of pop , as you said earlier if there are elements in the stack should consider return 0 but you consider is empty as return 0 ,I thought you wrote by mistake sir can you please tell
ohh thank u sir this is in the pace n style have always prayed for.
Thank you so much for the whole data structure series. It's great stuff. I really like the outro music, can someone tell me the name of the music or a link to it, would be really helpful.
Hi Varun,
Check this
Full Playlist of Data Structure
Explained very easily
th-cam.com/video/gh9siMkdLkM/w-d-xo.html
Love in with your content
at 8:57 he says in dynamic memory allocation there is no memory to store further, but its dynamic it can increase its memory so how can be full. please answer.
Sir please explain all lab programmes based on dsa according to vtu please explain all programmes
Thank you so much Sir 🙏
Sir, ele has to be returned right? Inside the else of the pop function.
yes
super explanation
While traversing, should the function return elements in LIFO order (as this is a stack) or FIFO order? Here FIFO is shown but LIFO is a better fit right?
thank you sir for helping
sir , where is the dynamic stack creation video?
why we can't use variables in square breackets without making it macro which has shown in 2:59.
God bless u sir
Sir please help me out,
In the pop() method the we are assinging the top element value to the variable "ele" { ele = stack[top] } , and after which we are reducing the top value but still the value that was previously was at top is not deleted [ i.e the value of "ele" is still in the array at top +1 position].
Super bro🔥🔥👌
how ele is taken i mean scanf("%d",ele) into stack at 15:15(time)
ante ela tiskuntam manam ele value ni stack lopaliki