Pilas con Stack

Hello, hello, how are we? On this occasion, we're going to look at linear lists and stacks, using them with procedures and functions. It's important to clarify that a stack is a linear structure where the first element inserted is the last one removed. Having said that, let's begin. To work with stacks, we must remember

that the processes performed with stacks are: create, check the size, insert, delete, search for an element, empty (which means removing all elements from the stack), display the last inserted element, check if the stack is full, check if the stack is empty, or display the elements in the stack, also known as printing. Here we return to the two

basic processes in stacks, regardless of whether they are handled with arrays or with a stack: insert (which is `puig`) and delete (which is ` pop`). For this, we must consider the following elements, which are important in handling them. This code, or this example, this video is focused mainly on outputting to the console.

We have to verify that the `you` library (specifically, the ` collection` library) is already present in our window. If it's not there, we need to add it. Next, it's important to note that the word `stack` is considered a constructor in the compiler, although it's technically a reserved word. We have a property that

tells us how many elements are actually in the stack, not how many spaces it has, which are very different concepts. For this, we have the following methods. By methods, we mean all the processes performed with them, not procedures and functions. We have this instruction, which allows us to insert elements; `pop`, which allows us