SIGN IN SIGN UP

Algorithms and Data Structures implemented in JavaScript for beginners, following best practices.

34084 0 0 JavaScript
2017-08-03 21:56:45 +05:30
/* Stack!!
* A stack is exactly what it sounds like. An element gets added to the top of
* the stack and only the element on the top may be removed. This is an example
* of an array implementation of a Stack. So an element can only be added/removed
* from the end of the array.
*/
// Functions: push, pop, peek, view, length
2020-05-03 09:05:12 +02:00
// Creates a stack constructor
const Stack = (function () {
2020-05-03 09:05:12 +02:00
function Stack () {
// The top of the Stack
this.top = 0
// The array representation of the stack
this.stack = []
}
2017-08-03 21:56:45 +05:30
2020-05-03 09:05:12 +02:00
// Adds a value onto the end of the stack
Stack.prototype.push = function (value) {
2020-05-03 09:05:12 +02:00
this.stack[this.top] = value
this.top++
}
2017-08-03 21:56:45 +05:30
2020-05-03 09:05:12 +02:00
// Removes and returns the value at the end of the stack
Stack.prototype.pop = function () {
if (this.top === 0) {
2020-05-03 09:05:12 +02:00
return 'Stack is Empty'
2017-08-03 21:56:45 +05:30
}
2020-05-03 09:05:12 +02:00
this.top--
const result = this.stack[this.top]
this.stack = this.stack.splice(0, this.top)
2020-05-03 09:05:12 +02:00
return result
}
2017-08-03 21:56:45 +05:30
2020-05-03 09:05:12 +02:00
// Returns the size of the stack
Stack.prototype.size = function () {
2020-05-03 09:05:12 +02:00
return this.top
}
2017-08-03 21:56:45 +05:30
2020-05-03 09:05:12 +02:00
// Returns the value at the end of the stack
Stack.prototype.peek = function () {
2020-05-03 09:05:12 +02:00
return this.stack[this.top - 1]
2017-08-03 21:56:45 +05:30
}
2020-05-03 09:05:12 +02:00
// To see all the elements in the stack
Stack.prototype.view = function (output = value => console.log(value)) {
for (let i = 0; i < this.top; i++) {
output(this.stack[i])
}
2020-05-03 09:05:12 +02:00
}
2020-05-03 09:05:12 +02:00
return Stack
}())
2017-08-03 21:56:45 +05:30
export { Stack }