A stack is a vertical array with the following 3 constraints:
\nYou can think of a stack as a stack of dishes, one on top of the other.
\nA term that is used to describe the operations we can perform on a stack is LIFO (Last In First Out). All this means is that the last item pushed onto a stack is always the first item popped from it.
\nA stack is an abstract data type - it is built on top of other built-in data structures. In our case, we will use arrays, which are built-in data structures in JavaScript.
\nWe will implement a stack data structure using JavaScript classes.
\nclass Stack {\n constructor() {\n this.data = []\n }\n\n add(element) {\n return this.data.push(element)\n }\n\n remove() {\n return this.data.pop()\n }\n\n peek() {\n return this.data[this.data.length - 1]\n }\n}\n\nconst stackOne = new Stack()\n\nstackOne.add(1)\nstackOne.add(10)\nstackOne.add(100)\n\nconsole.log(stackOne)\n\n// Stack { data: [ 1, 10, 100 ] }\n\nstackOne.remove()\n\nconsole.log(stackOne)\n// Stack { data: [ 1, 10 ] }\n\nconsole.log(stackOne.peek())\n// 10Whenever we create a new instance of the Stack class, JavaScript will invoke the constructor method to build an empty array, where we store our data.
The Stack class contains 3 methods that push new elements to the data array, pop elements from the data array and read elements from the data array.