Stack Data Structure in C++ Programming (using arrays) | All Stack Operations | Part - 2

preview_player
Показать описание
Support Simple Snippets by Donations -
--------------------------------------------------------------------------------------------- In this data structure tutorial we will be implementing stack datastructure and all its standard operations. We will implement stack using arrays in c++ programming language.
Following are the stack operations -
1) push() -
Place an item onto the stack. If there is no place for new item, stack is in overflow state.
2) pop() -
Return the item at the top of the stack and then remove it. If pop is called when stack is empty, it is in an underflow state.
3) isEmpty() -
Tells if the stack is empty or not
4) isfull() -
Tells if the stack is full or not.
5) peek() -
Access the item at the i position
6) count() -
Get the number of items in the stack.
7) change() -
Change the item at the i position
8) display() -
Display all items in the stack

If you want the full C++ Program code for Stack & Stack operations follow me on Instagram or Facebook (links given below) & send me your email address & I will mail the full code to you ✌

Simple Snippets Official Website -
Simple Snippets on Facebook -
Simple Snippets on Instagram -
Simple Snippets on Twitter -
Simple Snippets Google Plus Page -
Simple Snippets email ID -

#stack #stackprogram #datastructure #stackdatastructure #stackoperations #stackincpp
Рекомендации по теме
Комментарии
Автор

Hey Guys, if you want more such tech educational videos on this channel then please support me by subscribing to this channel & also share it with your friends as it helps me create more content just for you ✌

SimpleSnippets
Автор

Damn, it feels like you're learning from the cool kid in class and not the quiet one. You got a new sub!

rahul
Автор

my college fees wouldn't have been wasted if it would have been given to a teacher like you, shortest yet best way to clear all doubts from starting till the program, glad i found a great teacher, kuddos to you effort :)

OkayManish
Автор

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!

MrXenon-hnju
Автор

While in the mid of the video I am forced to comment this due to your well explanation which makes everything buttery Thank You

UserUser-tntv
Автор

Thanks alot man u r literally a saviour for students like me who have teachers who just go through theory and do not explain the implementation just to cover up the syllabus. Thanks alot

TheRandomTeamMate
Автор

I do not know even ABCD of programming in any of the technical languages, this right now is helping me prepare with data structures and algorithms, to my every IT companies interview, and I have my TCS NQT coming up, and cheers to you Thanmai ❤️
Now I can proudly understand programming language.

varshasaparam
Автор

Sir...
I m in love with your videos
I never thought that DSA is easy
All thanks to you

aryakushwah
Автор

Thanks! A great explanation. I am trying to learn C++ by watching your videos, so it's helping me a lot.
To improve the safety of the change operation a bit, I would add a check if the stack is empty and then exit from the function early, as there is nothing to change. And also add another check if the position is out of bounds (pos >= count()), then I would also exit from the function early.

circulardep
Автор

The Pain In Ass You Took For Taking It Soo Simple And Too The Point Also For Editing This Whole Video Is Damn Appreciated Mere Bhai🙏🏽 That Too Free Of Cost, literally Hats Off !

kavanshah
Автор

Thank so much teacher I had watched many videos but couldn't implement the stack . But after watching this video I got the actual logic. And now I'm am able to implement a stake.

gyanganga
Автор

you dont know how scared i was I have exam day after tomorrow you made it so easy thank so

aroobamalik
Автор

at time 19:32, for peak function you are taking position as input and checking isEmpty, but you should also check that position is valis(less than total size ) otherwise it may return junk value.
Great video... Thank you..!

chetanbm
Автор

So simple ❤️
After code with Harry u are the guy that deserves millions of subscribers.
Always been a very big fan of code with Harry and learned C++ and Web development from there. But for data structures and algorithms when I saw that he's using C language I got super tensed and frustrated. But thanks to Almighty God that I found your amazing channel.
Love u Bhai❤️🇧🇩

nafisahmed
Автор

Your dialoge representation with the code is very flammable and easy. Demonstration of each point through practical scree is wonderful i have watched this video for knowledge is going to be very helpful thanks 😊

ankushpaswan
Автор

18:55 sec you can use if(top>=pos) instead of isEmpty() because at a situation when user enter an index of 3 when they are only 2 elements in it

__SRIVARSHANS
Автор

nobody can explain in simple n easy way like you do . thanks bro!!

rutvikkachchhi
Автор

Best explanation of Stack Practical Implementation

travelnlearn
Автор

Incredible bro....
You jzz nailed it
Best source for learnig DSA.
U helped out alot

sourabhsivare
Автор

I found best lectures by simple snippets.
Thank you Sir.

Muhammad_Shoukat
welcome to shbcf.ru