What is STACK data structure in C++? What is LIFO? STL Stack explained in 14 mins! DATA STRUCTURES

У вашего броузера проблема в совместимости с HTML5

Want to learn stack data structure in under 15 minutes? In this video, I’m explaining what is stack, how to work with the STL stack in C++, what are real-life examples of stack use, and more.
You will also learn what is LIFO technique.

A stack is a type of data structure that uses LIFO (Last In - First Out) technique to store elements. This means that new elements are added at one end (top) and elements can be removed from that end only.
Other commonly used synonyms for the LIFO technique are FILO (First In - Last Out) and LCFS (Last Come - First Served)

In this video, I’ll also explain the five most important functions that you need to know if you want to work with stack data collections.
Those are: empty, size, push, pop, top.

Contents:
00:00 - Introduction
00:30 - What is Stack? What is LIFO?
01:40 - Example of stack use in real life
03:01 - Functions used to work with stack
03:56 - Implementation and working with STL Stack
09:31 - How to write out elements of the stack

You can find the code in the pinned comment.

Tag me on you Instagram story:
Instagram ???? - https://www.instagram.com/truecodebeauty/
Twitter ????- https://twitter.com/TrueCodeBeauty