Stack Data Structure in C++ Programming (using arrays) | All Stack Operations | Part – 2 | Thông tin về chủ đề stack c++ |

i want source code

12:00

Loved it, can you also make one on the same topic using LL

cout<<"Thank you from the bottom of my heart"

Explanation – ✅
Presentation – ✅
Approach – ✅

Thanks a ton for this video :).

Wow ❤️. I did not knew that stack that easy 🙂🔥🔥🔥. Ur logics r so simple and easy to understand.

Can you help me please

Hey Tanmay
In the constructor is it compulsory to assign every array element with zero?

i really appreciate your efforts

damn that was some great teaching. Thank you very much man.

Just one thing to say….Thank You

Great approach and easy to understand because of you. You kept things simple. Just one thing, for someone new, too much information has been fed in a single program. But seriously, very interesting videos.

Legend 🙏

What if we didn't return any popValue in Stack;

watch how he creates the class Stack and int mian with the switch and everything, after that go back to 6:30 and watch it over again, you will understand everythin much better

How to modify the array size with a user input?

Amazing Explanation!

thanks alot

Why you define first value -1?

Thank you so much! I am through 10 videos from your playlist and I've learned more than I have in the three CS classes I've taken in university in less than one week!

Woah, didn't know it was that easy

If anybody is looking for the same code in C language:

#include <stdio.h>

void push(int);

int pop(void);

void display();

int stack[5];

int stacktop=0;

int choice=0,val=0;

int main()

{

do

{

printf("n1.Pusht2.Popt3.displayt4.ExitnSelect your choice:n");

scanf("%d",&choice);

switch(choice)

{

case 1: printf("Enter the element to be pushed in the stack:n");

scanf("%d",&val);

push(val);

break;

case 2: val = pop();

if(val!=-1)

printf("Popped Element: %dn",val); //Here 'break;' is not not used. Therfore, after popping it will automatically display the elements.

case 3: display();

break;

case 4: break;

default:printf("nWrong Choice.");

break;

}

}while(choice!=4);

}

void push(int val)

{

if(stacktop<5)

{

stack[stacktop] = val;

stacktop++;

}

else

printf("nStack Overflow!");

}

int pop()

{

int a;

if(stacktop>0)

{

stacktop–;

a = stack[stacktop];

return a;

}

else

{

printf("Stack is Empty!");

}

}

void display()

{

int i=0;

if(stacktop>0)

{

printf("nElements in the stack are:n");

while(i<stacktop)

{

printf("%dt",stack[i++]);

}

printf("n");

}

else

printf("nStack is Empty!");

}

one of the best explanation Thank u so much for such a good video👍

The peek method is wrong. We can only access the top element in the stack.

Bro bro bro can't explain in words what you are for us who had fear by DSA and now its like I am enjoying it…….all the topics seem like they are tasks of a game …..its all because of you man ……Hats of to your lots of efforts, your so much time, your energy to create these content …..thnkuu soo much bhai!