Glad to be back delivering you guys more coding podcasts to help you on your coding journey! Today we're talking about the Stack ADT and how you can use it and implement it within your code. I highly recommend you guys go to hacker ranked and check out their examples on stacks to test your understanding from today's episode. Like always, if you have any questions regarding this podcast feel free to contact me at [email protected]. I will try my best to answer your questions as fast as possible. Enjoy!

 

SHOW NOTES

----------------

- think of a stack data like a stack of books, ice cream stack, and/or a stack of plates

- Stacks are a LIFO data structure, which means that it's a last in first out. So whatever object is placed last onto the stack will be the first one retrieved from it

- methods: push(T entry), pop(), isEmpty(), clear(), peek()

- YOU CAN ONLY ACCESS THE TOP ENTRY! (is it in your head yet)